Solving the sequential ordering problem with automatically generated lower bounds

MaRDI QIDQ4667106zbMATH OpenFDO

Authors István T. Hernádvölgyi

Publication date 19 April 2005

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• An inexact algorithm for the sequential ordering problem
• A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
• Local search procedures for improving feasible solutions to the sequential ordering problem
• A mixed-integer model for solving ordering problems with side constraints
• Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem

Cited in

(10)

• An inexact algorithm for the sequential ordering problem
• A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
• On dual based lower bounds for the sequential ordering problem with precedences and due dates
• An improved ant colony system for the sequential ordering problem
• Coupling ant colony systems with strong local searches
• Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
• Maximizing over multiple pattern databases speeds up heuristic search
• An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
• A hybrid particle swarm optimization approach for the sequential ordering problem
• A heuristic manipulation technique for the sequential ordering problem

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: Solving the sequential ordering problem with automatically generated lower bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4667106)