The following pages link to MCF (Q17307):
Displaying 27 items.
- Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem (Q331982) (← links)
- A school bus scheduling problem (Q439545) (← links)
- Column generation for extended formulations (Q458128) (← links)
- Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem (Q743645) (← links)
- A comparison of solution strategies for biobjective shortest path problems (Q958463) (← links)
- A two-phase algorithm for the biobjective integer minimum cost flow problem (Q1000988) (← links)
- Reconstructing (0,1)-matrices from projections using integer programming (Q1001203) (← links)
- Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows (Q1013387) (← links)
- Solving a fuel delivery problem by heuristic and exact approaches. (Q1410332) (← links)
- Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach (Q1652278) (← links)
- Variable fixing heuristics for solving multiple depot vehicle scheduling problem with heterogeneous fleet and time windows (Q1996750) (← links)
- Stabilized dynamic constraint aggregation for solving set partitioning problems (Q2253353) (← links)
- Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems (Q2433389) (← links)
- Supply chain optimization. (Q2574144) (← links)
- Vehicle Scheduling in Public Transit and Lagrangean Pricing (Q2784092) (← links)
- A Computational Study of Cost Reoptimization for Min-Cost Flow Problems (Q2892272) (← links)
- Minimum-cost flow algorithms: an experimental evaluation (Q2943810) (← links)
- Matching Contours in Images through the use of Curvature, Distance to Centroid and Global Optimization with Order-Preserving Constraint (Q3117471) (← links)
- A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem (Q3391966) (← links)
- (Q3551837) (← links)
- On the Effectiveness of the Linear Programming Relaxation of the 0-1 Multi-commodity Minimum Cost Network Flow Problem (Q3591293) (← links)
- (Q4414638) (← links)
- (Q4699378) (← links)
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem (Q4808430) (← links)
- Solving a bus driver scheduling problem with randomized multistart heuristics (Q4918247) (← links)
- Matching of objects nodal points improvement using optimization (Q5481768) (← links)
- Combining Column Generation and Lagrangian Relaxation (Q5493634) (← links)
