Subadditive approaches in integer programming
From MaRDI portal
Publication:2371344
DOI10.1016/j.ejor.2006.10.009zbMath1166.90012MaRDI QIDQ2371344
Publication date: 4 July 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.10.009
Related Items
Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory, On a class of subadditive duals for the uncapacitated facility location problem, Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions, Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions
Uses Software
Cites Work
- A primal dual integer programming algorithm
- A practical algorithm for computing a subadditive dual function for set partitioning
- Some polyhedra related to combinatorial problems
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Integer Programming with a Fixed Number of Variables
- Integer Programming and Pricing
- On general decomposition schemes in mathematical programming
- The group problem and integer programming duality
- Subadditive lifting methods for partitioning and knapsack problems
- Characterization of facets for multiple right-hand choice linear programs
- A resource decomposition algorithm for general mathematical programs
- Integer programming duality: Price functions and sensitivity analysis
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Introduction to Stochastic Programming
- A Computational Study of Search Strategies for Mixed Integer Programming
- Solution of a Large-Scale Traveling-Salesman Problem
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
