The path set polytope of an acyclic, directed graph with an application to machine sequencing

DOI10.1002/NET.3230190510MaRDI QIDQ4733692zbMATH OpenOpenAlexFDO

Authors John H. Vande Vate

Publication date 1989

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230190510

zbMATH Keywords

sequencingsourcedestinationlinear characterizationacyclic, directed graphpath set polytope

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Polytopes and polyhedra (52Bxx)

Recommendations

• On the facial structure of scheduling polyhedra
• scientific article; zbMATH DE number 1263289
• On cardinality constrained cycle and path polytopes
• A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)
• On the partial order polytope of a digraph

Cited in

(3)

• Polytopes associated with symmetry handling
• Long range planning in the process industries: A projection approach
• Projections of the capacitated network loading problem

This page was built for publication: The path set polytope of an acyclic, directed graph with an application to machine sequencing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733692)