scientific article; zbMATH DE number 1749222
From MaRDI portal
Publication:4532225
zbMath1076.90550MaRDI QIDQ4532225
Denis Naddef, Giovanni Rinaldi
Publication date: 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Optimal capacitated ring trees, Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows, The pickup and delivery problem with time windows, multiple stacks, and handling operations, New formulations and solution approaches for the latency location routing problem, Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks, Integer programming formulations for the elementary shortest path problem, The pickup and delivery problem with time windows and handling operations, Improved branch-cut-and-price for capacitated vehicle routing, An efficient variable neighborhood search heuristic for very large scale vehicle routing problems, Simultaneously exploiting two formulations: an exact Benders decomposition approach, Active-guided evolution strategies for large-scale capacitated vehicle routing problems, A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics, A Branch-and-Cut method for the Capacitated Location-Routing Problem, Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem, Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem, Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints, Recent advances in vehicle routing exact algorithms, A branch-and-cut method for the obnoxious \(p\)-median problem, Heuristic and exact algorithms for the multi-pile vehicle routing problem, New exact solution approaches for the split delivery vehicle routing problem, An optimization algorithm for the inventory routing problem with continuous moves, Formulations and exact algorithms for the vehicle routing problem with time windows, An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts, Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems, The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time, The separation problem of rounded capacity inequalities: some polynomial cases, On the complexity of the separation problem for rounded capacity inequalities, Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems, The bi-objective stochastic covering tour problem, Exact algorithms for routing problems under vehicle capacity constraints, Sequential search and its application to vehicle-routing problems, The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem, Decomposition and dynamic cut generation in integer linear programming, Robust branch-and-cut-and-price for the capacitated vehicle routing problem, Lagrangian duality applied to the vehicle routing problem with time windows, The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach, A personalized walking bus service requiring optimized route decisions: a real case, A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes, Strong cuts from compatibility relations for the dial-a-ride problem, A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities, Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty, Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times, Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading, A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal, Solving capacitated arc routing problems using a transformation to the CVRP, Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results, Projection results for vehicle routing
Uses Software
