The following pages link to (Q5687193):
Displayed 47 items.
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows (Q1777146) (← links)
- A route-neighborhood-based metaheuristic for vehicle routing problem with time windows (Q1806612) (← links)
- Fleet assignment and routing with schedule synchronization constraints (Q1806762) (← links)
- Multi-depot vehicle scheduling problems with time windows and waiting costs (Q1806860) (← links)
- A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree (Q1827840) (← links)
- On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem (Q1847167) (← links)
- LP models for bin packing and cutting stock problems (Q1847189) (← links)
- Tabu search heuristics for the vehicle routing problem with time windows. (Q1871417) (← links)
- Human resources management at a marine container terminal (Q1877919) (← links)
- A parallel hybrid genetic algorithm for the vehicle routing problem with time windows (Q1879791) (← links)
- Linear time approximation schemes for vehicle scheduling problems (Q1887080) (← links)
- A new branching strategy for time constrained routing problems with application to backhauling (Q1908295) (← links)
- A solution approach to find the critical path in a time-constrained activity network (Q2270440) (← links)
- Column generation approaches to ship scheduling with flexible cargo sizes (Q2379534) (← links)
- Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394) (← links)
- Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems (Q2433389) (← links)
- Algorithms for single machine total tardiness scheduling with sequence dependent setups (Q2433437) (← links)
- Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues (Q2433546) (← links)
- Cost-based filtering for shorter path constraints (Q2454811) (← links)
- Bi-dynamic constraint aggregation and subproblem reduction (Q2459403) (← links)
- A relax-and-cut algorithm for the set partitioning problem (Q2462542) (← links)
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints (Q2465940) (← links)
- Interior point stabilization for column generation (Q2465956) (← links)
- A model to optimize placement operations on dual-head placement machines (Q2467135) (← links)
- Distance preserving recombination operator for Earth observation satellites operations scheduling (Q2481604) (← links)
- Dynamic transport scheduling under multiple resource constraints (Q2485330) (← links)
- A labeling method for dynamic driver-task assignment with uncertain task durations (Q2488239) (← links)
- A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems (Q2488912) (← links)
- Nodal aggregation of resource constraints in a shortest path problem (Q2490165) (← links)
- A LP-based heuristic for a time-constrained routing problem (Q2491773) (← links)
- Minmax subtree cover problem on cacti (Q2495907) (← links)
- The routing open-shop problem on a network: complexity and approximation (Q2496075) (← links)
- Solving a class of stochastic mixed-integer programs with branch and price (Q2502208) (← links)
- A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows (Q2506187) (← links)
- Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
- Projection results for vehicle routing (Q2583125) (← links)
- Solving a real-world train-unit assignment problem (Q2638371) (← links)
- An effective and fast heuristic for the dial-a-ride problem (Q2644373) (← links)
- Vehicle routing problems with alternative paths: an application to on-demand transportation (Q2654320) (← links)
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems (Q2655613) (← links)
- Solving a rich vehicle routing and inventory problem using column generation (Q2655647) (← links)
- Dynamic programming algorithms for the elementary shortest path problem with resource constraints (Q3439161) (← links)
- Locating a cycle in a transportation or a telecommunications network (Q3593375) (← links)
- Column-Generation in Integer Linear Programming (Q4450558) (← links)
- Ship Routing Scheduling with Persistence and Distance Objecives (Q5850930) (← links)
- Constraint programming-based column generation (Q5902286) (← links)
- Ship scheduling with soft time windows: An optimisation based approach (Q5935388) (← links)