A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing

We present a strong cutting plane/branch-and-bound algorithm for node packing. The cutting planes are obtained from cliques and lifting odd hole inequalities. Computational results are reported.

Uloženo v:
Podrobná bibliografie
Vydáno v:The Journal of the Operational Research Society Ročník 43; číslo 5; s. 443 - 457
Hlavní autoři: Nemhauser, G. L., Sigismondi, G.
Médium: Journal Article
Jazyk:angličtina
Vydáno: London Taylor & Francis 01.05.1992
Macmillan Press
Palgrave Macmillan UK
Palgrave
Pergamon Press
Témata:
Algorithms
Applied sciences
Business and Management
Coefficients
Descendants
Discrete mathematics
Exact sciences and technology
Flows in networks. Combinatorial problems
General Paper
Heuristics
Integer Programming
Integers
Linear programming
Management
Networks and Graphs
Operational research and scientific management
Operational research. Management science
Operations research
Operations Research/Decision Theory
Optimal solutions
Networks and Graphs
Integer Programming
Heuristics
Integer programming
Experimental result
Branch and bound method
Graph clique
Graph node
Heuristic method
Network
Graph theory
Algorithm
Cutting plane method
ISSN:0160-5682, 1476-9360
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We present a strong cutting plane/branch-and-bound algorithm for node packing. The cutting planes are obtained from cliques and lifting odd hole inequalities. Computational results are reported.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0160-5682
1476-9360
DOI:10.1057/jors.1992.71