Integer-programming software systems
From MaRDI portal
Publication:817202
DOI10.1007/s10479-005-3968-2zbMath1091.90046OpenAlexW2140007372MaRDI QIDQ817202
Atamtürk, Alper, Savelsbergh, Martin W. P.
Publication date: 7 March 2006
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-005-3968-2
Integer programming (90C10) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
On polynomial kernels for sparse integer linear programs, The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design, Optimizing fuzzy \( p\)-hub center problem with generalized value-at-risk criterion, A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity, A MILP model for the teacher assignment problem considering teachers' preferences, Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations, A decomposition based solution algorithm for U-type assembly line balancing with interval data, The type E simple assembly line balancing problem: a mixed integer linear programming formulation, Cascading knapsack inequalities: reformulation of a crude oil distribution problem, Multi-level single machine lot-sizing and scheduling with zero lead times, Optimal decision trees for the algorithm selection problem: integer programming based approaches, Progress in presolving for mixed integer programming, Generalized resolution search, Two-row and two-column mixed-integer presolve using hashing-based pairing methods, Model predictive scheduling of semi-cyclic discrete-event systems using switching max-plus linear models and dynamic graphs, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Modeling and control of switching max-plus-linear systems with random and deterministic switching, An exact method with variable fixing for solving the generalized assignment problem, JuMP: A Modeling Language for Mathematical Optimization, Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems, A computational study of parametric tabu search for 0-1 mixed integer programs, Faster MIP solutions via new node selection rules, An improved mathematical program to solve the simple assembly line balancing problem, Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design, Planning production using mathematical programming: The case of a woodturning company, Presolve Reductions in Mixed Integer Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polyhedral study of the cardinality constrained knapsack problem
- Exploiting orbits in symmetric ILP
- Local branching
- Robust discrete optimization and network flows
- On the facets of the mixed-integer knapsack polyhedron
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Exploring relaxation induced neighborhoods to improve MIP solutions
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Computational study of a family of mixed-integer quadratic programming problems
- Gomory cuts revisited
- The feasibility pump
- Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables
- Branch-and-cut for combinatorial optimization problems without auxiliary binary variables
- Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
- Improving Discrete Model Representations via Symmetry Considerations
- Integer Programming and Pricing
- Uncapacitated lot-sizing: The convex hull of solutions
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- Aggregation and Mixed Integer Rounding to Solve MIPs
- On the Value of Binary Expansions for General Mixed-Integer Linear Programs
- Solving Large-Scale Zero-One Linear Programming Problems
- Valid Linear Inequalities for Fixed Charge Problems
- Computer Codes for Problems of Integer Programming
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- Practical Solution of Large Mixed Integer Programming Problems with Umpire
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- Facets of the Knapsack Polytope From Minimal Covers
- Branch and Bound Methods for Mathematical Programming Systems
- Covering, Packing and Knapsack Problems
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Introduction to Stochastic Programming
- Two‐stage stochastic integer programming: a survey
- Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- On the facial structure of set packing polyhedra
- Experiments in mixed-integer linear programming
- Investigation of some branch and bound strategies for the solution of mixed integer linear programs
- Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs
- Integer Programming and Combinatorial Optimization
