Variations and extensions of Proll's integer linear programming formulation techniques for the graph partitioning problem

DOI10.1080/0020739920230103zbMath0751.90052OpenAlexW2039624263MaRDI QIDQ4008221

Gamini Gunawardane

Publication date: 27 September 1992

Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020739920230103

zbMATH Keywords

graph partitioninginteger linear programs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Linear programming (90C05)

Cites Work

• Unnamed Item
• Dynamic versions of set covering type public facility location problems
• Formulation of integer linear programs: an example
• Identification of special structure constraints in linear programs
• Implicit representation of generalized variable upper bounds in linear programming

This page was built for publication: Variations and extensions of Proll's integer linear programming formulation techniques for the graph partitioning problem