Optimal Capacity Scheduling—I

DOI10.1287/OPRE.10.4.518MaRDI QIDQ3850363zbMATH OpenOpenAlexFDO

Authors Arthur F. jun. Veinott, Harvey M. Wagner

Publication date 1962

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.10.4.518

zbMATH Keywords

applications of probability theory and statistics

Cited in

(22)

• Exact algorithms and applications for tree-like Weighted Set Cover
• Optimal switching between cash-flow streams
• A faster algorithm for finding minimum Tucker submatrices
• Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
• Constraint programming and operations research
• Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
• On a variant of Flory model
• Rounding to an integral program
• Red-blue covering problems and the consecutive ones property
• Set covering with almost consecutive ones property
• A polynomial-time algorithm for finding a minimal conflicting set containing a given row
• Tree decompositions of graphs: saving memory in dynamic programming
• The practical conversion of linear programmes to network flow models
• Convex hull characterizations of lexicographic orderings
• On a generalization of Horn constraint systems
• The minimum shift design problem
• A survey of dynamic network flows
• Three generalizations of the FOCUS constraint
• Representing inverses in pure network flow optimization
• Analyzing fractional Horn constraint systems
• Fourier-Motzkin elimination and its dual
• Optimal capacity expansion

This page was built for publication: Optimal Capacity Scheduling—I

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3850363)