An inexact algorithm for the sequential ordering problem
From MaRDI portal
Recommendations
- Local search procedures for improving feasible solutions to the sequential ordering problem
- A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)
- scientific article; zbMATH DE number 1538846
- On the sequential ordering problems
- scientific article; zbMATH DE number 2159167
Cites work
- A Cutting Plane Algorithm for the Linear Ordering Problem
- A restricted Lagrangean approach to the traveling salesman problem
- Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph
- An inexact algorithm for the sequential ordering problem
- Facets of the linear ordering polytope
- scientific article; zbMATH DE number 3932819 (Why is no real title available?)
- scientific article; zbMATH DE number 3633982 (Why is no real title available?)
- Local Search for the Asymmetric Traveling Salesman Problem
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
Cited in
(45)- An inexact algorithm for the sequential ordering problem
- The order of Appel's algorithm
- Local search procedures for improving feasible solutions to the sequential ordering problem
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
- On due-date based valid cuts for the sequential ordering problem
- An improved ant colony system for the sequential ordering problem
- The multi-pickup and delivery problem with time windows
- Coupling ant colony systems with strong local searches
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
- Strong cuts from compatibility relations for the dial-a-ride problem
- Exact algorithms for the multi-pickup and delivery problem with time windows
- An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers
- Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints
- A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
- Compact formulations of the Steiner traveling salesman problem and related problems
- An exact dynamic programming algorithm for the precedence-constrained class sequencing problem
- On the sequential ordering problems
- A branch-and-cut algorithm for the preemptive swapping problem
- scientific article; zbMATH DE number 4016556 (Why is no real title available?)
- A sequential ordering problem in automotive paint shops
- Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
- Paint batching problem on M-to-1 conveyor systems
- scientific article; zbMATH DE number 4072711 (Why is no real title available?)
- scientific article; zbMATH DE number 3570344 (Why is no real title available?)
- scientific article; zbMATH DE number 4123514 (Why is no real title available?)
- scientific article; zbMATH DE number 1538846 (Why is no real title available?)
- scientific article; zbMATH DE number 2159167 (Why is no real title available?)
- Optimizing the starting point in a precedence constrained routing problem with complicated travel cost functions
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin-Marsten bounding
- A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem
- Solving the traveling salesperson problem with precedence constraints by deep reinforcement learning
- Formulations for the clustered traveling salesman problem with d-relaxed priority rule
- Precedence-constrained arborescences
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm
- A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem
- A hybrid particle swarm optimization approach for the sequential ordering problem
- New solution approaches for balancing assembly lines with setup times
- A survey on the traveling salesman problem and its variants in a warehousing context
- Computing Hamiltonian paths with partial order restrictions
- A graph width perspective on partially ordered Hamiltonian paths and cycles ii: vertex and edge deletion numbers
- Parallelization strategies for rollout algorithms
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
- Sequential unreliable newsboy ordering policies
- A production planning problem in FMS
- A heuristic manipulation technique for the sequential ordering problem
This page was built for publication: An inexact algorithm for the sequential ordering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108187)
