A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems
From MaRDI portal
Publication:5101409
DOI10.1007/3-540-59408-6_45zbMath1498.90137OpenAlexW1561337421MaRDI QIDQ5101409
Paolo Toth, Silvano Martello, Laureano Fernando Escudero Bueno
Publication date: 30 August 2022
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-59408-6_45
Related Items
\(O(n \log n)\) procedures for tightening cover inequalities, The multidimensional 0-1 knapsack problem: an overview.
Uses Software
Cites Work
- Unnamed Item
- S3 sets. An extension of the Beale-Tomlin special ordered sets
- MINTO, a Mixed INTeger Optimizer
- Efficient reformulation for 0-1 programs -- methods and computational results
- \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
- A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- Solving Large-Scale Zero-One Linear Programming Problems
- A New Algorithm for the 0-1 Knapsack Problem
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Technical Note—A Note on Zero-One Programming
- Facets of the knapsack polytope
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Facets of the Knapsack Polytope From Minimal Covers
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
