The splitting of variables and constraints in the formulation of integer programming models
From MaRDI portal
Publication:1278148
DOI10.1016/S0377-2217(96)00236-6zbMath0918.90106OpenAlexW2144244107MaRDI QIDQ1278148
Sally C. Brailsford, H. Paul Williams
Publication date: 1997
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00236-6
Related Items
A note on splitting of variables in integer programming models ⋮ Modelling either-or relations in integer programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong formulations for mixed integer programming: A survey
- Using separation algorithms to generate mixed integer model reformulations
- Logic-based decision support. Mixed integer model formulation
- Disjunctive programming: Properties of the convex hull of feasible points
- An alternative explanation of disjunctive formulations
- The two-period travelling salesman problem applied to milk collection in Ireland
- Fourier-Motzkin elimination and its dual
- Organizing a social event --- A difficult problem of combinatorial optimization
- Fourier's Method of Linear Programming and Its Dual
- Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Multicommodity Distribution System Design by Benders Decomposition
- The reformulation of two mixed integer programming problems
- An integer programming approach to a class of combinatorial problems
This page was built for publication: The splitting of variables and constraints in the formulation of integer programming models