Integer and combinatorial optimization
Integer and combinatorial optimization
A global approach to crew-pairing optimization
IBM Systems Journal
Solving airline crew scheduling problems by branch-and-cut
Management Science
A primal dual integer programming algorithm
Discrete Applied Mathematics - ARIDAM IV and V
Parallel branch-and-cut for set partitioning
Parallel branch-and-cut for set partitioning
Integer Programming Duality in Multiple Objective Programming
Journal of Global Optimization
Solving the p-Median Problem with a Semi-Lagrangian Relaxation
Computational Optimization and Applications
| Hi-index | 0.00 |
The linear programming duality is well understood and the reduced cost of a column is frequently used in various algorithms. On the other hand, for integer programs it is not clear how to define a dual function even though the subadditive dual theory was developed a long time ago. In this work we propose a family of computationally tractable subadditive dual functions for integer programs. We develop a solution methodology that computes an optimal primal solution and an optimal subadditive dual function. We report computational results for set partitioning instances. To the best of our knowledge these are the first computational experiments on computing the optimal subadditive dual function.