Pages that link to "Item:Q2815450"
From MaRDI portal
The following pages link to New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows (Q2815450):
Displayed 27 items.
- Pricing routines for vehicle routing with time windows on road networks (Q337163) (← links)
- Scheduled penalty variable neighborhood search (Q337204) (← links)
- Bounding, filtering and diversification in CP-based local branching (Q519096) (← links)
- Hybrid optimization methods for time-dependent sequencing problems (Q1751901) (← links)
- Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems (Q1754114) (← links)
- Perspectives on integer programming for time-dependent models (Q2001858) (← links)
- Comments on: ``Perspectives on integer programming for time-dependent models'' (Q2001859) (← links)
- Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks (Q2011598) (← links)
- Unconstrained binary models of the travelling salesman problem variants for quantum optimization (Q2102287) (← links)
- Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version (Q2108179) (← links)
- Stochastic decision diagrams (Q2170193) (← links)
- Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows (Q2174903) (← links)
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows (Q2189879) (← links)
- A column generation approach for a multi-attribute vehicle routing problem (Q2629734) (← links)
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery (Q2672110) (← links)
- Discrete Optimization with Decision Diagrams (Q2806864) (← links)
- An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP (Q3386761) (← links)
- Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows (Q5060801) (← links)
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances (Q5106421) (← links)
- An Exact Solution Framework for Multitrip Vehicle-Routing Problems with Time Windows (Q5130490) (← links)
- Network-Based Approximate Linear Programming for Discrete Optimization (Q5144795) (← links)
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (Q5865336) (← links)
- Mixed integer programming formulations for the generalized traveling salesman problem with time windows (Q6057720) (← links)
- The bus sightseeing problem (Q6080627) (← links)
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows (Q6096613) (← links)
- Integrating driver behavior into last-mile delivery routing: combining machine learning and optimization in a hybrid decision support framework (Q6168609) (← links)
- Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams (Q6426110) (← links)
