Pages that link to "Item:Q1108187"

The following pages link to An inexact algorithm for the sequential ordering problem (Q1108187):

Displaying 31 items.

• Compact formulations of the Steiner traveling salesman problem and related problems (Q257227) (← links)
• Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem (Q322625) (← links)
• Paint batching problem on \(M\)-to-1 conveyor systems (Q342469) (← links)
• A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem (Q602676) (← links)
• A hybrid particle swarm optimization approach for the sequential ordering problem (Q622165) (← links)
• Parallelization strategies for rollout algorithms (Q812417) (← links)
• A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
• A production planning problem in FMS (Q917423) (← links)
• A heuristic manipulation technique for the sequential ordering problem (Q925838) (← links)
• An inexact algorithm for the sequential ordering problem (Q1108187) (← links)
• Local search procedures for improving feasible solutions to the sequential ordering problem (Q1309885) (← links)
• A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships (Q1339126) (← links)
• On due-date based valid cuts for the sequential ordering problem (Q1367938) (← links)
• An improved ant colony system for the sequential ordering problem (Q1652370) (← links)
• The multi-pickup and delivery problem with time windows (Q1744529) (← links)
• Coupling ant colony systems with strong local searches (Q1926808) (← links)
• Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (Q1991103) (← links)
• Strong cuts from compatibility relations for the dial-a-ride problem (Q2065792) (← links)
• Exact algorithms for the multi-pickup and delivery problem with time windows (Q2178121) (← links)
• An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers (Q2350866) (← links)
• Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints (Q2362374) (← links)
• A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse (Q2514749) (← links)
• An exact dynamic programming algorithm for the precedence-constrained class sequencing problem (Q2664413) (← links)
• A branch-and-cut algorithm for the preemptive swapping problem (Q2913951) (← links)
• A sequential ordering problem in automotive paint shops (Q3159669) (← links)
• OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS (Q5125218) (← links)
• Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (Q5865336) (← links)
• Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule (Q6065592) (← links)
• Precedence-constrained arborescences (Q6109804) (← links)
• Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)
• A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem (Q6164630) (← links)