scientific article; zbMATH DE number 863504

zbMath0854.90118MaRDI QIDQ4871783

Antoon W. J. Kolen, Jan Karel Lenstra

Publication date: 19 January 1997

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

zbMATH Keywords

surveyvehicle routingtraveling salesmanjob shop schedulingminimum cost flowcollection of examplestest coverclique partitioninglinear orderingreal-world problemsinterval schedulingbottleneck extremamultiple postmenpractical decision situations

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Integer programming (90C10) Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Related Items (8)

The clique partitioning problem: Facets and patching facets ⋮ Fixed interval scheduling: models, applications, computational complexity and algorithms ⋮ A minimum violations ranking method ⋮ Interval scheduling: A survey ⋮ The \(k\)-Track assignment problem on partial orders ⋮ A mathematical model and a metaheuristic approach for a memory allocation problem ⋮ A solution method for a car fleet management problem with maintenance constraints ⋮ On local search for the generalized graph coloring problem

This page was built for publication: