scientific article; zbMATH DE number 858990

From MaRDI portal

Publication:4872476

Jump to:navigation, search

zbMath0863.90086MaRDI QIDQ4872476

Johann L. Hurink

Publication date: 21 March 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

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

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items (2)

Polygon scheduling ⋮ Tabu search for the job-shop scheduling problem with multi-purpose machines

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4872476&oldid=19240158"