The following pages link to (Q3048579):
Displaying 14 items.
- A new approach for crew pairing problems by column generation with an application to air transportation (Q1098764) (← links)
- A network relaxation based enumeration algorithm for set partitioning (Q1123128) (← links)
- Membership functions, some mathematical programming models and production scheduling (Q1165156) (← links)
- Cores of partitioning games (Q1168899) (← links)
- A characterization of the uncapacitated network design polytope (Q1200785) (← links)
- Scheduling with neural networks -- the case of the Hubble Space Telescope (Q1200817) (← links)
- A surrogate heuristic for set covering problems (Q1342046) (← links)
- Exact satisfiability, a natural extension of set partition, and its average case behavior (Q1353993) (← links)
- An algorithm for set covering problem (Q1823139) (← links)
- An optimization modeling for customer redistribution and its spreadsheet implementation (Q1891246) (← links)
- A relax-and-cut algorithm for the set partitioning problem (Q2462542) (← links)
- A heuristic with tie breaking for certain 0–1 integer programming models (Q3731368) (← links)
- Use of hidden network structure in the set partitioning problem (Q5101414) (← links)
- A continuous problem of optimal partition with a nondifferentiable functional (Q5951288) (← links)
