Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
Decomposition, reformulation, and diving in university course timetabling
Computers and Operations Research
Review: Measuring instance difficulty for combinatorial optimization problems
Computers and Operations Research
Relax-and-fix decomposition technique for solving large scale grid-based location problems
Computers and Industrial Engineering
A decision support system for patient scheduling in travel vaccine administration
Decision Support Systems
| Hi-index | 0.00 |
Creating good integer programming formulations had, as a basic axiom, the rule “Find formulations with tighter linear relaxations”. This rule, while useful when using unsophisticated branch-and-bound codes,is insufficient when using state-of-the-art codes that understand and embed many of the obvious formulation improvements. As these optimization codes become more sophisticated it is important to have finer control over their operation. Modelers need to be even more creative in reformulating their integer programs in order to improve on the automatic reformulations of the optimization codes.