scientific article; zbMATH DE number 863504

MaRDI QIDQ4871783zbMATH OpenFDO

Authors Antoon W. J. Kolen, Jan Karel Lenstra

Publication date 19 January 1997

zbMATH Keywords

bottleneck extremaclique partitioningcollection of examplesinterval schedulingjob shop schedulinglinear orderingminimum cost flowmultiple postmenpractical decision situationsreal-world problemssurveytest covertraveling salesmanvehicle routing

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1302177
• scientific article; zbMATH DE number 1391431
• Optimal scheduling combinatorics
• Combinatorial, linear, integer and nonlinear optimization apps. COLINA grande

Cited in

(13)

• A solution method for a car fleet management problem with maintenance constraints
• On local search for the generalized graph coloring problem
• The k-Track assignment problem on partial orders
• Interval scheduling: A survey
• A minimum violations ranking method
• scientific article; zbMATH DE number 1301843 (Why is no real title available?)
• scientific article; zbMATH DE number 1302177 (Why is no real title available?)
• The clique partitioning problem: Facets and patching facets
• scientific article; zbMATH DE number 4114383 (Why is no real title available?)
• scientific article; zbMATH DE number 1391431 (Why is no real title available?)
• Practical combinatorial
• A mathematical model and a metaheuristic approach for a memory allocation problem
• Fixed interval scheduling: models, applications, computational complexity and 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 Q4871783)