scientific article; zbMATH DE number 863504

zbMATH Open0854.90118MaRDI QIDQ4871783FDOQ4871783

Authors: Antoon W. J. Kolen, Jan Karel Lenstra 

Publication date: 19 January 1997

Title of this publication is not available (Why is that?)

Recommendations

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

zbMATH Keywords

surveyjob shop schedulingtest covervehicle routingminimum cost flowtraveling salesmanclique partitioninglinear orderingreal-world problemsinterval schedulingcollection of examplesbottleneck extremamultiple postmenpractical decision situations

Mathematics Subject Classification ID

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

Cited In (11)

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

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)