Sciweavers

945 search results - page 16 / 189
» Incremental Branching Programs
Sort
View
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
MPC
1998
Springer
65views Mathematics» more  MPC 1998»
13 years 12 months ago
A Unifying Framework for Correct Program Construction
Abstract. We present a description technique for the correct construction of programs that allows us to de ne terms like re nement, modelchecking, and synthesis as special operatio...
Henning Dierks, Michael Schenke
ANOR
2005
124views more  ANOR 2005»
13 years 7 months ago
On Compact Formulations for Integer Programs Solved by Column Generation
Column generation has become a powerful tool in solving large scale integer programs. It is well known that most of the often reported compatibility issues between pricing subprobl...
Daniel Villeneuve, Jacques Desrosiers, Marco E. L&...
ESOP
1999
Springer
13 years 12 months ago
Dynamic Programming via Static Incrementalization
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
Yanhong A. Liu, Scott D. Stoller
IPCO
2008
118views Optimization» more  IPCO 2008»
13 years 9 months ago
Constraint Orbital Branching
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...