Pages that link to "Item:Q3898330"

The following pages link to Cyclic Scheduling via Integer Programs with Circular Ones (Q3898330):

Displaying 50 items.

• Optimization-based heuristics for underground mine scheduling (Q299816) (← links)
• Application of the cohort-intelligence optimization method to three selected combinatorial optimization problems (Q322485) (← links)
• A faster algorithm for finding minimum Tucker submatrices (Q693064) (← links)
• Vertex adjacencies in the set covering polyhedron (Q730484) (← links)
• The cyclical scheduling problem (Q744050) (← links)
• Approximation algorithms for scheduling unrelated parallel machines (Q751989) (← links)
• Total weak unimodularity: Testing and applications (Q798401) (← links)
• MIP reformulations of the probabilistic set covering problem (Q847820) (← links)
• Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms (Q865749) (← links)
• Scheduling workforce relief breaks in advance versus in real-time (Q872250) (← links)
• Static and dynamic source locations in undirected networks (Q889101) (← links)
• A survey of dynamic network flows (Q917417) (← links)
• Chvátal closures for mixed integer programming problems (Q922950) (← links)
• Soft car sequencing with colors: lower bounds and optimality proofs (Q932214) (← links)
• The stable set polytope of quasi-line graphs (Q949780) (← links)
• Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381) (← links)
• Combining integer programming and the randomization method to schedule employees (Q1038393) (← links)
• Multicuts and integral multiflows in rings (Q1041998) (← links)
• Processes with alternating activities (Q1108186) (← links)
• Parametric shortest path algorithms with an application to cyclic staffing (Q1149254) (← links)
• A heuristic procedure for the crew rostering problem (Q1194743) (← links)
• Extensions of coloring models for scheduling purposes (Q1268282) (← links)
• Scheduling staff using mixed integer programming (Q1278723) (← links)
• Cyclic and non-cyclic scheduling of 12h shift nurses by network programming (Q1291691) (← links)
• A rounding algorithm for integer programs (Q1327212) (← links)
• Balancing problems in acyclic networks (Q1327220) (← links)
• An efficient two-phase algorithm for cyclic days-off scheduling. (Q1406704) (← links)
• Nurse rostering problems -- a bibliographic survey. (Q1410304) (← links)
• A comparative evaluation of modeling approaches to the labor shift scheduling problem (Q1580984) (← links)
• Tabu search and iterated local search for the cyclic bottleneck assignment problem (Q1652664) (← links)
• An extension of a theorem of Fulkerson and Gross (Q1816927) (← links)
• Staff scheduling at the United States postal Service (Q1870829) (← links)
• Human resources management at a marine container terminal (Q1877919) (← links)
• Parametric formulation of the general integer linear programming problem (Q1919968) (← links)
• The representation polyhedron of a semiorder. (Q1943679) (← links)
• The column-circular, subsets-selection problem: Complexity and solutions (Q1974273) (← links)
• Minimizing the number of workers in a paced mixed-model assembly line (Q1991120) (← links)
• Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
• A cyclic integer covering problem (Q2277140) (← links)
• A resource type analysis of the integrated project scheduling and personnel staffing problem (Q2398432) (← links)
• The minimum shift design problem (Q2468734) (← links)
• On dominating set polyhedra of circular interval graphs (Q2659194) (← links)
• Group control for consent rules with consecutive qualifications (Q2682019) (← links)
• Single-Sink Multicommodity Flow with Side Constraints (Q2971620) (← links)
• A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row (Q3007640) (← links)
• Integer Rounding for Polymatroid and Branching Optimization Problems (Q3668310) (← links)
• An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs (Q3960133) (← links)
• A class of manpower scheduling problems (Q4000927) (← links)
• (Q5204003) (← links)
• Distance-Preserving Graph Contractions (Q5233754) (← links)