Pages that link to "Item:Q2783791"

The following pages link to An exact constraint logic programming algorithm for the traveling salesman problem with time windows (Q2783791):

Displaying 41 items.

• Pricing routines for vehicle routing with time windows on road networks (Q337163) (← links)
• A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows (Q337225) (← links)
• History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence (Q342093) (← links)
• A general VNS heuristic for the traveling salesman problem with time windows (Q429659) (← links)
• The delivery man problem with time windows (Q429673) (← links)
• Improved filtering for weighted circuit constraints (Q487627) (← links)
• A variable iterated greedy algorithm for the traveling salesman problem with time windows (Q506326) (← links)
• Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints (Q1651588) (← links)
• Efficient filtering for the resource-cost alldifferent constraint (Q1701236) (← links)
• On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem (Q1847167) (← links)
• Perspectives on integer programming for time-dependent models (Q2001858) (← links)
• The item dependent stockingcost constraint (Q2009188) (← links)
• The weighted arborescence constraint (Q2011589) (← links)
• Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks (Q2011598) (← links)
• A matheuristic for the generalized order acceptance and scheduling problem (Q2077965) (← links)
• Unconstrained binary models of the travelling salesman problem variants for quantum optimization (Q2102287) (← 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)
• Improving the filtering of branch-and-bound MDD solver (Q2117223) (← links)
• Beam-ACO for the travelling salesman problem with time windows (Q2270441) (← links)
• Integrated production and material handling scheduling using mathematical programming and constraint programming (Q2433554) (← links)
• An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation (Q2482754) (← links)
• A constraint programming approach to the Chinese postman problem with time windows (Q2496043) (← links)
• A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints (Q2664428) (← links)
• A bibliometric and social network analysis of data-driven heuristic methods for logistics problems (Q2691477) (← links)
• A column generation model for a scheduling problem with maintenance constraints (Q2741258) (← links)
• Optimizing Time Slot Allocation in Single Operator Home Delivery Problems (Q2806900) (← links)
• A time bucket formulation for the traveling salesman problem with time windows (Q2815434) (← links)
• New state-space relaxations for solving the traveling salesman problem with time windows (Q2815450) (← links)
• Hybrids of Constructive Metaheuristics and Constraint Programming: A Case Study with ACO (Q2950522) (← links)
• Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem (Q3342216) (← links)
• An ant colony system approach for variants of the traveling salesman problem with time windows (Q3429053) (← links)
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows (Q4849335) (← links)
• (Q5020990) (← links)
• Combining Two Structured Domains for Modeling Various Graph Matching Problems (Q5302726) (← links)
• New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times (Q5746675) (← 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)
• The Synchronized Dynamic Vehicle Dispatching Problem (Q6160388) (← 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)