Pages that link to "Item:Q2815434"
From MaRDI portal
The following pages link to A time bucket formulation for the traveling salesman problem with time windows (Q2815434):
Displaying 37 items.
- Pricing routines for vehicle routing with time windows on road networks (Q337163) (← links)
- Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies (Q342075) (← links)
- Enhanced mixed integer programming techniques and routing problems (Q657574) (← links)
- A classification of formulations for the (time-dependent) traveling salesman problem (Q1388929) (← links)
- Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
- An integer programming approach for the time-dependent traveling salesman problem with time windows (Q1651554) (← links)
- The windy rural postman problem with a time-dependent zigzag option (Q1751757) (← 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)
- A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows (Q2033323) (← links)
- Branch-and-refine for solving time-expanded MILP formulations (Q2108138) (← links)
- Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version (Q2108179) (← links)
- Optimizing the changing locations of mobile parcel lockers in last-mile distribution (Q2184067) (← links)
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows (Q2189879) (← links)
- Beam-ACO for the travelling salesman problem with time windows (Q2270441) (← links)
- An iterative graph expansion approach for the scheduling and routing of airplanes (Q2337398) (← links)
- Routing optimization with time windows under uncertainty (Q2414906) (← links)
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery (Q2672110) (← links)
- An exact constraint logic programming algorithm for the traveling salesman problem with time windows (Q2783791) (← links)
- A bucket indexed formulation for nonpreemptive single machine scheduling problems (Q2806861) (← links)
- New state-space relaxations for solving the traveling salesman problem with time windows (Q2815450) (← links)
- (Q3080636) (← links)
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows (Q3141769) (← 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)
- Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems (Q5086009) (← links)
- A Joint Vehicle Routing and Speed Optimization Problem (Q5137953) (← links)
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut (Q5943078) (← links)
- Mixed integer programming formulations for the generalized traveling salesman problem with time windows (Q6057720) (← links)
- An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem (Q6066724) (← links)
- An exact algorithm for the service network design problem with hub capacity constraints (Q6085889) (← links)
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows (Q6096613) (← links)
- A general variable neighborhood search for the traveling salesman problem with time windows under various objectives (Q6153469) (← links)
- Integrating driver behavior into last-mile delivery routing: combining machine learning and optimization in a hybrid decision support framework (Q6168609) (← links)
- A MaxSAT approach for solving a new dynamic discretization discovery model for train rescheduling problems (Q6568503) (← links)
- Layered graph models for the electric vehicle routing problem with nonlinear charging functions (Q6663970) (← links)
