A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
From MaRDI portal
Cited in
(23)- An extension of set partitioning with application to scheduling problems
- 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
- Enhancing an algorithm for set covering problems
- Algorithms for large scale set covering problems
- A Lagrangean decomposition solution to a single line multiproduct scheduling problem
- Graph theoretic relaxations of set covering and set partitioning problems
- Network simplex algorithm for the general equal flow problem.
- A parallel genetic algorithm to solve the set-covering problem
- Lagrangean relaxation. (With comments and rejoinder).
- The column-circular, subsets-selection problem: Complexity and solutions
- Implementation of a Double-Basis Simplex Method for the General Linear Programming Problem
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- An efficient lagrangean relaxation scheme for linear and integer equal flow problems
- Scheduling Models: Shibboleth and Operating Characteristics
- Use of hidden network structure in the set partitioning problem
- An homage to Joseph-Louis Lagrange and Pierre Huard
- Set covering approach for reconstruction of sibling relationships
- Polyhedral results and stronger Lagrangean bounds for stable spanning trees
- Network models for vehicle and crew scheduling
- Integer equal flows
- A decomposition-based pricing method for solving a large-scale MILP model for an integrated fishery
This page was built for publication: A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3895231)
