OptimalI-Intersection assignments for graphs: A linear programming approach

DOI10.1002/NET.3230130301MaRDI QIDQ3309474zbMATH OpenOpenAlexFDO

Authors Robert J. Opsut, Fred Roberts

Publication date 1983

Published in Networks (Search for Journal in Brave)

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

zbMATH Keywords

intersection assignment for a graph

Mathematics Subject Classification ID

Linear programming (90C05) Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Extremal problems in graph theory (05C35) Integer programming (90C10)

Cites work

• {{#invoke:WikidataIB|getLink|Q3328583}} scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• {{#invoke:WikidataIB|getLink|Q5732670}} A Characterization of Comparability Graphs and of Interval Graphs
• {{#invoke:WikidataIB|getLink|Q2395457}} Incidence matrices and interval graphs

Cited in

(3)

• Applications of edge coverings by cliques
• Optimal multiple interval assignments in frequency assignment and traffic phasing
• Representations of graphs and networks (coding, layouts and embeddings)

This page was built for publication: OptimalI-Intersection assignments for graphs: A linear programming approach

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