Recommendations
Cites work
- A conditional logic approach for strengthening mixed 0-1 linear programs
- A global approach to crew-pairing optimization
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- A Note on Coefficient Adjustment Using Sos Constraints
- A Note on Extreme-Point Solutions and A Paper by Lemke, Salkin, and Spielberg
- Airline crew scheduling: state-of-the-art
- Algorithms for the Simple Plant-Location Problem with Some Side Conditions
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- An analysis of approximations for maximizing submodular set functions—I
- An Automatic Method of Solving Discrete Programming Problems
- Applying a modified coefficient reduction method to a dynamic production scheduling model
- Direct Search Algorithms for Zero-One and Mixed-Integer Programming
- Fixed-cost transportation problems
- Flows in Arborescences
- Generalized implicit enumeration using bounds on variables for solving linear programs with zero‐one variables
- scientific article; zbMATH DE number 3643032 (Why is no real title available?)
- scientific article; zbMATH DE number 3661100 (Why is no real title available?)
- scientific article; zbMATH DE number 3717129 (Why is no real title available?)
- scientific article; zbMATH DE number 3504679 (Why is no real title available?)
- scientific article; zbMATH DE number 3550467 (Why is no real title available?)
- scientific article; zbMATH DE number 3559283 (Why is no real title available?)
- scientific article; zbMATH DE number 3598222 (Why is no real title available?)
- scientific article; zbMATH DE number 3635849 (Why is no real title available?)
- scientific article; zbMATH DE number 1416629 (Why is no real title available?)
- scientific article; zbMATH DE number 3323527 (Why is no real title available?)
- scientific article; zbMATH DE number 3400670 (Why is no real title available?)
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Integer Programming: Methods, Uses, Computations
- Local branching
- Logical processing for integer programming
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- MIP: Theory and practice -- closing the gap
- Model tightening for integrated timber harvest and transportation planning
- On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems
- On tightening cover induced inequalities
- Outline of an algorithm for integer solutions to linear programs
- Partitioning procedures for solving mixed-variables programming problems
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Routing with time windows by column generation
- Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- Solving Large-Scale Zero-One Linear Programming Problems
Cited in
(4)
This page was built for publication: Logical processing for integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817209)
