Valid inequalities for a class of assembly system problems
From MaRDI portal
Publication:1584810
DOI10.1016/S0377-2217(99)00278-7zbMath0970.90047MaRDI QIDQ1584810
Anulark Pinnoi, Wilbert E. Wilhelm
Publication date: 5 November 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
optimizationinteger programmingcutting planebranch-and-cutworkload smoothingassembly system designnode packing problems
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Operations research and management science (90B99)
Cites Work
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
- Assembly System Design: A Branch and Cut Approach
- An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem
- Assembly-Line Balancing by Linear Programming
- An Integer Programming Procedure for Assembly System Design Problems
- Solving Large-Scale Zero-One Linear Programming Problems
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Technical Note—Assembly-Line Balancing: Zero-One Programming with Fibonacci Search
- Covering, Packing and Knapsack Problems
- A family of hierarchical models for the design of deterministic assembly systems
- A Branch and Cut Approach for Workload Smoothing on Assembly Lines
This page was built for publication: Valid inequalities for a class of assembly system problems
