Sciweavers

50 search results - page 1 / 10
» Computational Experience with an Interior Point Cutting Plan...
Sort
View
117
Voted
SIAMJO
2000
116views more  SIAMJO 2000»
15 years 26 days ago
Computational Experience with an Interior Point Cutting Plane Algorithm
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...
John E. Mitchell
JOTA
2011
149views more  JOTA 2011»
14 years 8 months ago
Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization
: Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms d...
Napsu Karmitsa, Mario Tanaka Filho, José He...
110
Voted
CCE
2005
15 years 1 months ago
Phenotype phase plane analysis using interior point methods
Phenotype phase plane analysis is a linear optimization procedure which can be used to study the value of the objective function (a desired phenotype) as two variables (external s...
Steven L. Bell, Bernhard O. Palsson
125
Voted
EOR
2010
140views more  EOR 2010»
14 years 10 months ago
Cutting plane algorithms for 0-1 programming based on cardinality cuts
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
Osman Oguz
100
Voted
SIAMJO
2000
74views more  SIAMJO 2000»
15 years 26 days ago
A Specialized Interior-Point Algorithm for Multicommodity Network Flows
Abstract. Despite the efficiency shown by interior-point methods in large-scale linear programming, they usually perform poorly when applied to multicommodity flow problems. The ne...
Jordi Castro