Sciweavers

817 search results - page 29 / 164
» Exact solutions to linear programming problems
Sort
View
EOR
2006
59views more  EOR 2006»
13 years 7 months ago
Sensitivity analysis in linear optimization: Invariant support set intervals
Sensitivity analysis is one of the most interesting and preoccupying areas in optimization. Many attempts are made to investigate the problem's behavior when the input data c...
Alireza Ghaffari Hadigheh, Tamás Terlaky
ISPD
1997
ACM
186views Hardware» more  ISPD 1997»
13 years 11 months ago
EWA: exact wiring-sizing algorithm
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
Rony Kay, Gennady Bucheuv, Lawrence T. Pileggi
MP
2007
142views more  MP 2007»
13 years 7 months ago
Active-constraint variable ordering for faster feasibility of mixed integer linear programs
The selection of the branching variable can greatly affect the speed of the branch and bound solution of a mixed-integer or integer linear program. Traditional approaches to branc...
Jagat Patel, John W. Chinneck
NETWORKS
2008
13 years 7 months ago
A linear programming approach to increasing the weight of all minimum spanning trees
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...
Mourad Baïou, Francisco Barahona
COR
2010
108views more  COR 2010»
13 years 7 months ago
GRASP and path relinking for the max-min diversity problem
The Max-Min Diversity Problem (MMDP) consists in selecting a subset of elements from a given set in such a way that the diversity among the selected elements is maximized. The prob...
Mauricio G. C. Resende, Rafael Martí, Micae...