A Hierarchy of Relaxations Leading to the Convex Hull Representation for General Discrete Optimization Problems
B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty*
Integer-Programming Software Systems
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization*
On a Fix-and-Relax Framework for a Class of Project Scheduling Problems
Metaheuristics in Combinatorial Optimization
Some Classes of Valid Inequalities and Convex Hull Characterizations for Dynamic Fixed-Charge Problems under Nested Constraints
“Miniaturized” Linearizations for Quadratic 0/1 Problems
Logical Processing for Integer Programming
Airline Crew Scheduling
Solving Planning and Design Problems in the Process Industry Using Mixed Integer and Global Optimization
Non Delayed Relax-and-Cut Algorithms