Lower bounds to the graph partitioning problem through generalized linear programming and network flows

From MaRDI portal

Revision as of 14:42, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3807012

Jump to:navigation, search

DOI10.1051/ro/1987210403491zbMath0657.90095OpenAlexW2468889070MaRDI QIDQ3807012

No author found.

Publication date: 1987

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/104928

zbMATH Keywords

exact solution branch-and-bound graph partitioning sharp bounds polynomial solvability continuous relaxation max-flow column generation subproblem large-scale set partitioning large-scale Boolean linear programming quadratic pseudo- Boolean minimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (5)

On some large-scale LP relaxations for the graph partitioning problem and their optimal solutions ⋮ Cluster analysis and mathematical programming ⋮ Image space approach to penalty methods ⋮ Improved Lagrangean decomposition: An application to the generalized assignment problem ⋮ Topological graph clustering with thin position

This page was built for publication: Lower bounds to the graph partitioning problem through generalized linear programming and network flows

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3807012&oldid=17382270"