A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
From MaRDI portal
Publication:3895231
DOI10.1287/mnsc.26.3.274zbMath0448.90042OpenAlexW2159446692MaRDI QIDQ3895231
Roy E. Marsten, Fred Shepardson
Publication date: 1980
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.26.3.274
Lagrangean relaxationcomputational resultssubgradient optimizationlarge problems0-1 constraint coefficientstwo duty period scheduling problem
Related Items
Lagrangean relaxation. (With comments and rejoinder)., Integer equal flows, A Lagrangean decomposition solution to a single line multiproduct scheduling problem, Layering strategies for creating exploitable structure in linear and integer programs, A structural Lagrangean relaxation for two-duty period bus driver scheduling problems, A network relaxation based enumeration algorithm for set partitioning, Graph theoretic relaxations of set covering and set partitioning problems, Use of hidden network structure in the set partitioning problem, Polyhedral results and stronger Lagrangean bounds for stable spanning trees, Network simplex algorithm for the general equal flow problem., Lagrangean decomposition: A model yielding stronger lagrangean bounds, A decomposition-based pricing method for solving a large-scale MILP model for an integrated fishery, The column-circular, subsets-selection problem: Complexity and solutions, Enhancing an algorithm for set covering problems, An homage to Joseph-Louis Lagrange and Pierre Huard, Set covering approach for reconstruction of sibling relationships, Scheduling Models: Shibboleth and Operating Characteristics, Network models for vehicle and crew scheduling, An efficient lagrangean relaxation scheme for linear and integer equal flow problems, Algorithms for large scale set covering problems, An extension of set partitioning with application to scheduling problems, A parallel genetic algorithm to solve the set-covering problem, Implementation of a Double-Basis Simplex Method for the General Linear Programming Problem
