Výsledky vyhľadávania - "cutting plane/branch and bound algorithm"
-
1
A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
ISSN: 0160-5682, 1476-9360Vydavateľské údaje: London Taylor & Francis 01.05.1992Vydané v The Journal of the Operational Research Society (01.05.1992)“…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…”
Získať plný text
Journal Article -
2
A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
ISSN: 0160-5682Vydavateľské údaje: 01.05.1992Vydané v The Journal of the Operational Research Society (01.05.1992)Získať plný text
Journal Article -
3
A cutting plane algorithm for a single machine scheduling problem
ISSN: 0377-2217, 1872-6860Vydavateľské údaje: Amsterdam Elsevier B.V 01.12.2000Vydané v European journal of operational research (01.12.2000)“…Each of N part types (production families or items) is to be processed on a single machine. The part types arrive into the buffer in front of the machine at…”
Získať plný text
Journal Article -
4
Set Partitioning: A Survey
ISSN: 0036-1445, 1095-7200Vydavateľské údaje: Philadelphia The Society for Industrial and Applied Mathematics 01.10.1976Vydané v SIAM review (01.10.1976)“…This paper discusses the set partitioning or equality-constrained set covering problem. It is a survey of theoretical results and solution methods for this…”
Získať plný text
Journal Article -
5
Maximizing a submodular function by integer programming: A polyhedral approach
ISBN: 9798208247839Vydavateľské údaje: ProQuest Dissertations & Theses 01.01.1991“…Let N = $\{$1,2, ...,n$\}$ be a finite set. A set function f is submodular if f(S) + f(T) $\geq$ f(S $\cup$ T) + f(S $\cap$ T) for all S, T $\subseteq$ N. The…”
Získať plný text
Dissertation
