The following pages link to Optimal Capacity Scheduling—I (Q3850363):
Displaying 22 items.
- Convex hull characterizations of lexicographic orderings (Q330274) (← links)
- Optimal switching between cash-flow streams (Q684138) (← links)
- A faster algorithm for finding minimum Tucker submatrices (Q693064) (← links)
- The practical conversion of linear programmes to network flow models (Q757237) (← links)
- Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms (Q865749) (← links)
- Exact algorithms and applications for tree-like Weighted Set Cover (Q866547) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- Rounding to an integral program (Q943791) (← links)
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381) (← links)
- Red-blue covering problems and the consecutive ones property (Q1018089) (← links)
- Representing inverses in pure network flow optimization (Q1068691) (← links)
- Constraint programming and operations research (Q1616390) (← links)
- Analyzing fractional Horn constraint systems (Q2205946) (← links)
- Set covering with almost consecutive ones property (Q2386204) (← links)
- Three generalizations of the FOCUS constraint (Q2398512) (← links)
- On a generalization of Horn constraint systems (Q2399383) (← links)
- Tree decompositions of graphs: saving memory in dynamic programming (Q2465936) (← links)
- The minimum shift design problem (Q2468734) (← links)
- Fourier-Motzkin elimination and its dual (Q2559426) (← links)
- A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row (Q3007640) (← links)
- Optimal capacity expansion (Q5567592) (← links)
- On a variant of Flory model (Q6585267) (← links)
