On due-date based valid cuts for the sequential ordering problem

DOI10.1007/BF02568536zbMath0893.90088MaRDI QIDQ1367938

Laureano Fernando Escudero Bueno, M. Teresa Ortuño

Publication date: 22 July 1998

Published in: Top (Search for Journal in Brave)

zbMATH Keywords

integer programmingLagrangean relaxationdirected graphHamiltonian pathsequential ordering problemvalid cutstighteningprecedence relationshipsminimum weight Hamiltonian path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Nonlinear programming (90C30) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Cites Work

• An inexact algorithm for the sequential ordering problem
• 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
• The precedence-constrained asymmetric traveling salesman polytope
• A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)

This page was built for publication: On due-date based valid cuts for the sequential ordering problem