Pages that link to "Item:Q3895231"

The following pages link to A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem (Q3895231):

Displaying 23 items.

• An homage to Joseph-Louis Lagrange and Pierre Huard (Q537596) (← links)
• Network models for vehicle and crew scheduling (Q792872) (← links)
• Integer equal flows (Q833591) (← links)
• A decomposition-based pricing method for solving a large-scale MILP model for an integrated fishery (Q933875) (← links)
• An extension of set partitioning with application to scheduling problems (Q1060959) (← links)
• Layering strategies for creating exploitable structure in linear and integer programs (Q1117840) (← links)
• A structural Lagrangean relaxation for two-duty period bus driver scheduling problems (Q1121170) (← links)
• A network relaxation based enumeration algorithm for set partitioning (Q1123128) (← links)
• Enhancing an algorithm for set covering problems (Q1194745) (← links)
• Algorithms for large scale set covering problems (Q1309874) (← links)
• A Lagrangean decomposition solution to a single line multiproduct scheduling problem (Q1342036) (← links)
• Graph theoretic relaxations of set covering and set partitioning problems (Q1390264) (← links)
• Network simplex algorithm for the general equal flow problem. (Q1406491) (← links)
• A parallel genetic algorithm to solve the set-covering problem (Q1603319) (← links)
• Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
• The column-circular, subsets-selection problem: Complexity and solutions (Q1974273) (← links)
• Implementation of a Double-Basis Simplex Method for the General Linear Programming Problem (Q3694975) (← links)
• Lagrangean decomposition: A model yielding stronger lagrangean bounds (Q3780005) (← links)
• An efficient lagrangean relaxation scheme for linear and integer equal flow problems (Q4224668) (← links)
• Scheduling Models: Shibboleth and Operating Characteristics (Q4747900) (← links)
• Use of hidden network structure in the set partitioning problem (Q5101414) (← links)
• Set covering approach for reconstruction of sibling relationships (Q5758164) (← links)
• Polyhedral results and stronger Lagrangean bounds for stable spanning trees (Q6110626) (← links)