Publication:4872476
From MaRDI portal
zbMath0863.90086MaRDI QIDQ4872476
Publication date: 21 March 1996
convex optimization; NP-hard; linear constraints; railway scheduling; network flow problems; heuristic methods; local search heuristics; continuous optimization problem; scheduling irregular polygons; vertices on a circle
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
90B10: Deterministic network models in operations research
Related Items