Cited in
(33)- scientific article; zbMATH DE number 1953192 (Why is no real title available?)
- scientific article; zbMATH DE number 1361557 (Why is no real title available?)
- Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems
- Matching of objects nodal points improvement using optimization
- On the Effectiveness of the Linear Programming Relaxation of the 0-1 Multi-commodity Minimum Cost Network Flow Problem
- Vehicle scheduling in public transit and Lagrangean pricing
- A computational study of cost reoptimization for min-cost flow problems
- Minimum-cost flow algorithms: an experimental evaluation
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
- Reconstructing (0,1)-matrices from projections using integer programming
- Algorithm of dynamic programming for optimization of the global matching between two contours defined by ordered points
- A school bus scheduling problem
- Matching contours in images through the use of curvature, distance to centroid and global optimization with order-preserving constraint
- Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach
- A comparison of solution strategies for biobjective shortest path problems
- Column generation for extended formulations
- CDT
- MCFClass
- RelaxIV
- LinTim
- CS2
- MCFSimplex
- Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
- Solving a bus driver scheduling problem with randomized multistart heuristics
- Supply chain optimization.
- Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem
- A two-phase algorithm for the biobjective integer minimum cost flow problem
- Solving a fuel delivery problem by heuristic and exact approaches.
- Combining Column Generation and Lagrangian Relaxation
- Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows
- Stabilized dynamic constraint aggregation for solving set partitioning problems
- Variable fixing heuristics for solving multiple depot vehicle scheduling problem with heterogeneous fleet and time windows
This page was built for software: MCF
