Fifty years of operational research: 1972--2022
From MaRDI portal
Cites work
- A branch and bound algorithm for the capacitated vehicle routing problem
- A concise guide to existing and emerging vehicle routing problem variants
- A districting-based heuristic for the coordinated capacitated arc routing problem
- A Dynamic Programming Formulation with Diverse Applications
- A general multi-shift scheduling system
- A generalized insertion algorithm for the seriation problem
- A generic exact solver for vehicle routing and related problems
- A heuristic for the location of a rapid transit line
- A metaheuristic for the time-dependent pollution-routing problem
- A new model for automated examination timetabling
- A path-based solution approach for the green vehicle routing problem
- A Priori Optimization
- A Priori Optimization of the Probabilistic Traveling Salesman Problem
- A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations
- A Spectral Algorithm for Seriation and the Consecutive Ones Problem
- A survey of search methodologies and automated system development for examination timetabling
- A tabu search heuristic and adaptive memory procedure for political districting
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges
- A unified solution framework for multi-attribute vehicle routing problems
- A Vehicle Routing Problem with Stochastic Demand
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem
- An energy-efficient green-vehicle routing problem with mixed vehicle fleet, partial battery recharging and time windows
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- An Improved Integer L-Shaped Method for the Vehicle Routing Problem with Stochastic Demands
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- Analysis of an exact algorithm for the vessel speed optimization problem
- Arc routing under uncertainty: introduction and literature review
- Assessing the efficiency of rapid transit configurations
- Corridor-based metro network design with travel flow capture
- Decomposition Strategies for Vehicle Routing Heuristics
- Designing delivery districts for the vehicle routing problem with stochastic demands
- Districting for arc routing
- Dynamic design of sales territories
- Edmonds polytopes and a hierarchy of combinatorial problems
- Efficient generation of rotating workforce schedules
- Electric vehicle routing problem with time-dependent waiting times at recharging stations
- scientific article; zbMATH DE number 4147519 (Why is no real title available?)
- scientific article; zbMATH DE number 3526435 (Why is no real title available?)
- scientific article; zbMATH DE number 3566863 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1749220 (Why is no real title available?)
- scientific article; zbMATH DE number 1749222 (Why is no real title available?)
- scientific article; zbMATH DE number 3892967 (Why is no real title available?)
- scientific article; zbMATH DE number 6741972 (Why is no real title available?)
- scientific article; zbMATH DE number 3193293 (Why is no real title available?)
- Improved branch-cut-and-price for capacitated vehicle routing
- Improved branch-cut-and-price for capacitated vehicle routing
- Improved formulations and algorithmic components for the electric vehicle routing problem with nonlinear charging functions
- Incidence matrices and interval graphs
- Incidence matrices, interval graphs and seriation in archeology
- Integer programming approaches to the travelling salesman problem
- Integrated planning for electric commercial vehicle fleets: a case study for retail mid-haul logistics networks
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Models and exact solutions for a class of stochastic location-routing problems
- Multi-objective rapid transit network design with modal competition: the case of Concepción, Chile
- New methods to color the vertices of a graph
- Optimal Routing under Capacity and Distance Restrictions
- Optimal sequencing of skip collections and deliveries
- Optimizing access to drinking water in remote areas. Application to Nepal
- Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
- Partitioning procedures for solving mixed-variables programming problems
- Path based algorithms for metro network design
- Political districting: From classical models to recent approaches
- Rapid transit network design for optimal cost and origin-destination demand capture
- Reducing fuel emissions by optimizing speed on shipping routes
- Rotating schedules
- Route and speed optimization for autonomous trucks
- Schedule design for liner services under vessel speed reduction incentive programs
- Seriation and matrix reordering methods: An historical overview
- Solution of a Large-Scale Traveling-Salesman Problem
- Solving a family of permutation problems on 0-1 matrices
- Solving a home-care districting problem in an urban setting
- Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm
- Solving real-size stochastic railway rapid transit network construction scheduling problems
- Some contributions of Ailsa H. Land to the study of the traveling salesman problem
- Subsidy design in a vessel speed reduction incentive program under government policies
- Tactical network planning for food aid distribution in Kenya
- The art and science of designing rotating schedules
- The bi-objective pollution-routing problem
- The capacitated vehicle routing problem with stochastic demands and time windows
- The commodity-split multi-compartment capacitated arc routing problem
- The electric vehicle routing problem with shared charging stations
- The green mixed fleet vehicle routing problem with partial battery recharging and time windows
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- The NP-completeness of the bandwidth minimization problem
- The truck dispatching problem
- The Vehicle Routing Problem with Stochastic Travel Times
- Transport of skips between recycling centers and treatment facilities
- Using cutting planes to solve the symmetric Travelling Salesman problem
- Vehicle Routing
- Vehicle routing with stochastic demands and restricted failures
- Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
Cited in
(2)
This page was built for publication: Fifty years of operational research: 1972--2022
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982596)
