Li Han-Lin

Han-Lin Li

Information about the author Han-Lin Li will soon be added to the site.
Found 22 papers in total
Linear Reformulation of Polynomial Discrete Programming for Fast Computation
Linear Reformulation of Polynomial Discrete Programming for Fast Computation
2017
Polynomial discrete programming problems are commonly faced but hard to solve....
A Logarithmic Method for Reducing Binary Variables and Inequality Constraints in Solving Task Assignment Problems
A Logarithmic Method for Reducing Binary Variables and Inequality Constraints in Solving Task Assignment Problems
2013
This paper studies the classical task assignment problem (TAP) in which M unbreakable...
Convex relaxation for solving posynomial programs
Convex relaxation for solving posynomial programs
2010
Convex underestimation techniques for nonlinear functions are an essential part of...
A global optimization method for packing problems
A global optimization method for packing problems
2006
The objective of packing problems is to determine an optimal way of placing a given...
Detecting and adjusting ordinal and cardinal inconsistencies through a graphical and optimal approach in analytic hierarchy process models
Detecting and adjusting ordinal and cardinal inconsistencies through a graphical and optimal approach in analytic hierarchy process models
2007
An AHP model suffering from significant cardinal or/and ordinal inconsistencies in its...
Adjusting ordinal and cardinal inconsistencies in decision preferences based on Gower plots
Adjusting ordinal and cardinal inconsistencies in decision preferences based on Gower plots
2006
Gower plots provide a powerful graphical tool to detect cardinal and ordinal...
A linear programming approach for identifying a consensus sequence on DNA sequences
A linear programming approach for identifying a consensus sequence on DNA sequences
2005
Maximum-likelihood methods for solving the consensus sequence identification (CSI)...
On optimization approach for multidisk vertical allocation problems
On optimization approach for multidisk vertical allocation problems
2005
Multidisk vertical allocation (MDVA) problems intend to find an allocation of...
Constrained abductive reasoning with fuzzy parameters in Bayesian networks
Constrained abductive reasoning with fuzzy parameters in Bayesian networks
2005
This work proposes a novel approach for solving abductive reasoning problems in...
Global optimization for signomial discrete programming problems in engineering design
Global optimization for signomial discrete programming problems in engineering design
2002
This paper proposes a novel method to solve signomial discrete programming (SDP)...
Approximately global optimization for assortment problems using piecewise linearization techniques
Approximately global optimization for assortment problems using piecewise linearization techniques
2002
Recently, Li and Chang proposed an approximate model for assortment problems. Although...
An algorithm for generalized fuzzy binary linear programming problems
An algorithm for generalized fuzzy binary linear programming problems
2001
Fuzzy binary linear programming (FBLP) problems are very essential in many fields such...
A fast algorithm for assortment optimization problems
A fast algorithm for assortment optimization problems
2001
Assortment optimization problems intend to seek the best way of placing a given set of...
Solving multiple objective quasi-convex goal programming problems by linear programming
Solving multiple objective quasi-convex goal programming problems by linear programming
2000
This study presents a novel means of resolving multiple objective goal programming...
Incorporating competence sets of decision makers by deduction graphs
Incorporating competence sets of decision makers by deduction graphs
1999
This paper proposes an optimization model of incorporating competence sets of group...
A robust optimization model for stochastic logistic problems
A robust optimization model for stochastic logistic problems
2000
The main difficulty of a logistic management problem is in the face of uncertainty...
A global optimization method for nonconvex separable programming problems
A global optimization method for nonconvex separable programming problems
1999
Conventional methods of solving nonconvex separable programming (NSP) problems by...
An approximate approach of global optimization for polynomial programming problems
An approximate approach of global optimization for polynomial programming problems
1998
Many methods for solving polynomial programming problems can only find locally optimal...
An approximately global optimization method for assortment problems
An approximately global optimization method for assortment problems
1998
Assortment problems occur when we want to cut a number of small rectangular pieces...
A global approach for general 0-1 fractional programming
A global approach for general 0-1 fractional programming
1994
Current methods of general 0-1 fractional programming (G-FP) can only find the local...
A new global approach for 0-1 polynomial programs
A new global approach for 0-1 polynomial programs
1994
Given a polynomial expression where and are variables, the famous Glover and Woolsey...
An approximate method for local optima for nonlinear mixed integer programming problems
An approximate method for local optima for nonlinear mixed integer programming problems
1992
For a nonlinear 0-1 integer programming problem with constraint set , new constraints...
Papers per page: