Pages that link to "Item:Q3832317"

The following pages link to An Additive Bounding Procedure for Combinatorial Optimization Problems (Q3832317):

Displaying 36 items.

• The tree representation for the pickup and delivery traveling salesman problem with LIFO loading (Q421561) (← links)
• Improved filtering for weighted circuit constraints (Q487627) (← links)
• Bounding, filtering and diversification in CP-based local branching (Q519096) (← links)
• Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
• Recent advances in vehicle routing exact algorithms (Q926561) (← links)
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965) (← links)
• Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
• The pickup and delivery traveling salesman problem with first-in-first-out loading (Q1000960) (← links)
• An additive bounding procedure for the asymmetric travelling salesman problem (Q1184344) (← links)
• A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems (Q1194853) (← links)
• On symmetric subtour problems (Q1202764) (← links)
• A heuristic algorithm for the asymmetric capacitated vehicle routing problem (Q1266654) (← links)
• Minimum directed 1-subtree relaxation for score orienteering problem (Q1291640) (← links)
• A branch-and-bound approach for spare unit allocation in a series system (Q1333525) (← links)
• Exact and approximation algorithms for makespan minimization on unrelated parallel machines (Q1363647) (← links)
• A bound for the symmetric travelling salesman problem through matroid formulation (Q1388823) (← links)
• Hybrid optimization methods for time-dependent sequencing problems (Q1751901) (← links)
• Cluster based branching for the asymmetric traveling salesman problem (Q1806732) (← links)
• Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling (Q1806914) (← links)
• New lower bounds for the symmetric travelling salesman problem (Q1824572) (← links)
• An efficient genetic algorithm for the traveling salesman problem with precedence constraints (Q1848588) (← links)
• A capacitated general routing problem on mixed networks (Q1894722) (← links)
• An exact algorithm for the capacitated shortest spanning arborescence (Q1908299) (← links)
• Exact makespan minimization of unrelated parallel machines (Q2165594) (← links)
• Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints (Q2455613) (← links)
• A new VRPPD model and a hybrid heuristic solution approach for e-tailing (Q2514740) (← links)
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
• An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP (Q3386761) (← links)
• CP-Based Local Branching (Q3523091) (← links)
• Recent Models and Algorithms for One-to-One Pickup and Delivery Problems (Q3564363) (← links)
• Exact Multiple Sequence Alignment by Synchronized Decision Diagrams (Q4995098) (← links)
• A Stochastic Integer Programming Approach to Air Traffic Scheduling and Operations (Q5144771) (← links)
• Driver scheduling based on “driver-friendly” vehicle schedules (Q5176323) (← links)
• A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks (Q5326779) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading (Q6160334) (← links)