Pages that link to "Item:Q1060959"
From MaRDI portal
The following pages link to An extension of set partitioning with application to scheduling problems (Q1060959):
Displaying 18 items.
- A model for bus crew scheduling problem with multiple duty types (Q714275) (← links)
- Network models for vehicle and crew scheduling (Q792872) (← links)
- Partially ordered knapsack and applications to scheduling (Q881568) (← links)
- A dual ascent procedure for the set partitioning problem (Q955334) (← links)
- An extension of set partitioning with application to scheduling problems (Q1060959) (← links)
- On the integer properties of scheduling set partitioning models (Q1100095) (← links)
- Reformulation of the set partitioning problem as a pure network with special order set constraints (Q1265886) (← links)
- On some difficult linear programs coming from set partitioning (Q1348247) (← links)
- Graph theoretic relaxations of set covering and set partitioning problems (Q1390264) (← links)
- An intelligent system for US Coast Guard cutter scheduling (Q1390329) (← links)
- A set partitioning approach to shunting (Q1759839) (← links)
- A review of goal programming and its applications (Q1904704) (← links)
- The column-circular, subsets-selection problem: Complexity and solutions (Q1974273) (← links)
- A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) (← links)
- Integrated rolling stock deadhead routing and timetabling in urban rail transit lines (Q2076825) (← links)
- On the extension complexity of scheduling polytopes (Q2661503) (← links)
- A set partitioning approach to shunting (Q2840563) (← links)
- Progress in Artificial Intelligence (Q5191553) (← links)
