Pages that link to "Item:Q1890926"

The following pages link to The precedence-constrained asymmetric traveling salesman polytope (Q1890926):

Displaying 48 items.

• Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem (Q322625) (← links)
• Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
• A hybrid particle swarm optimization approach for the sequential ordering problem (Q622165) (← links)
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm (Q847836) (← links)
• A branch-and-cut algorithm for factory crane scheduling problem (Q897052) (← links)
• A heuristic manipulation technique for the sequential ordering problem (Q925838) (← links)
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q1041945) (← links)
• Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading (Q1046716) (← links)
• On due-date based valid cuts for the sequential ordering problem (Q1367938) (← links)
• An integer programming approach for the time-dependent traveling salesman problem with time windows (Q1651554) (← links)
• What are the worst cases in constrained last-in-first-out pick-up and delivery problems? (Q1651694) (← links)
• Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks (Q1652571) (← links)
• The multi-pickup and delivery problem with time windows (Q1744529) (← links)
• A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions (Q1751254) (← links)
• Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system (Q1751731) (← links)
• The traveling salesman problem with draft limits (Q1761142) (← links)
• New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q1886799) (← links)
• Coupling ant colony systems with strong local searches (Q1926808) (← links)
• Branch-and-bound for the precedence constrained generalized traveling salesman problem (Q1984690) (← links)
• Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (Q1991103) (← links)
• Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning (Q2028802) (← links)
• The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach (Q2029026) (← links)
• A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints (Q2029262) (← links)
• Strong cuts from compatibility relations for the dial-a-ride problem (Q2065792) (← links)
• Branch-and-refine for solving time-expanded MILP formulations (Q2108138) (← links)
• The multiple Steiner TSP with order constraints: complexity and optimization algorithms (Q2156919) (← links)
• Exact algorithms for the multi-pickup and delivery problem with time windows (Q2178121) (← links)
• A branch-and-cut algorithm for the generalized traveling salesman problem with time windows (Q2189879) (← links)
• Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results (Q2343997) (← links)
• Reachability cuts for the vehicle routing problem with time windows (Q2432846) (← links)
• New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP (Q2466786) (← links)
• Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
• A new VRPPD model and a hybrid heuristic solution approach for e-tailing (Q2514740) (← links)
• Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2670579) (← links)
• The multi-commodity pickup-and-delivery traveling salesman problem (Q2811323) (← links)
• A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows (Q2815434) (← links)
• Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem (Q2907956) (← links)
• A branch-and-cut algorithm for the preemptive swapping problem (Q2913951) (← links)
• New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2968488) (← links)
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading (Q3057131) (← links)
• An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP (Q3386761) (← links)
• Recent Models and Algorithms for One-to-One Pickup and Delivery Problems (Q3564363) (← links)
• A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q5326770) (← links)
• IFORS' Operational Research Hall of Fame (Q5488254) (← links)
• Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (Q5865336) (← links)
• A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs (Q6064162) (← links)
• Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)
• Reliable production process design problem: compact MILP model and ALNS-based primal heuristic (Q6588744) (← links)