Two mixed integer programming formulations arising in manufacturing management
From MaRDI portal
Publication:1262212
DOI10.1016/0166-218X(90)90097-VzbMath0685.90072OpenAlexW1970674157MaRDI QIDQ1262212
Publication date: 1990
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(90)90097-v
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Valid inequalities and separation for uncapacitated fixed charge networks
- Representability in mixed integer programming. I: Characterization results
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Logic-based decision support. Mixed integer model formulation
- Mixed integer minimization models for piecewise-linear functions of a single variable
- A converse for disjunctive constraints
- Integer programming formulation of combinatorial optimization problems
- A property of assignment type mixed integer linear programming problems
- Integer and mixed-integer programming models: General properties
- Cutting-planes for programs with disjunctive constraints
- Dynamic Version of the Economic Lot Size Model
- Modelling with integer variables
- A New Formulation for the Travelling Salesman Problem
- Uncapacitated lot-sizing: The convex hull of solutions
- Experimental Results on the New Techniques for Integer Programming Formulations
- Valid Linear Inequalities for Fixed Charge Problems
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Rational Mixed-Integer and Polyhedral Union Minimization Models
- On Cutting Planes
- A theoretical and computational comparison of “equivalent” mixed-integer formulations
- On the existence of optimal solutions to integer and mixed-integer programming problems
- Measures of the non-convexity of sets and the Shapley–Folkman–Starr theorem
- Two Rules for Deducing Valid Inequalities for 0-1 Problems
- Disjunctive Programming
- A Deterministic Multi-Period Production Scheduling Model with Backlogging
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
