Node-Packing Problems with Integer Rounding Properties

DOI10.1137/0402036MaRDI QIDQ4729830zbMATH OpenOpenAlexFDO

Authors Shailesh K. Tipnis, Leslie E. jun. Trotter

Publication date 1989

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://hdl.handle.net/1813/8711

zbMATH Keywords

integer programmingnode-packing problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 3926633
• Set packing relaxations of some integer programs
• Properties of some ILP formulations of a class of partitioning problems
• Comparison of formulations and a heuristic for packing Steiner trees in a graph
• scientific article; zbMATH DE number 3976364

Cited in

(7)

• Dynamic node packing
• Testing additive integrality gaps
• The complexity of the node capacitated in-tree packing problem
• A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
• scientific article; zbMATH DE number 3926633 (Why is no real title available?)
• Set packing relaxations of some integer programs
• Friendly bin packing instances without integer round-up property

This page was built for publication: Node-Packing Problems with Integer Rounding Properties

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