scientific article; zbMATH DE number 3576997

MaRDI QIDQ4146536zbMATH OpenFDO

Authors Ken Steiglitz, Christos Papadimitriou

Publication date 1976

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99) Search theory (90B40) Applications of mathematical programming (90C90)

Cited in

(9)

• Reoptimization of minimum and maximum traveling salesman's tours
• Non deterministic polynomial optimization problems and their approximations
• Largest \(j\)-simplices in \(n\)-polytopes
• On inverse traveling salesman problems
• Lexicographically minimizing axial motions for the Euclidean TSP
• The searching over separators strategy to solve some NP-hard problems in subexponential time
• Multi-shuttle crane scheduling in automated storage and retrieval systems
• Approximating Alternative Solutions
• NP-Complete operations research problems and approximation algorithms

This page was built for publication:

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