Complete description for the spanning tree problem with one linearised quadratic term
Year of publication: |
2013
|
---|---|
Authors: | Fischer, Anja ; Fischer, Frank |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 41.2013, 6, p. 701-705
|
Subject: | Polyhedral combinatorics | Complete description | Spanning tree problem | Quadratic zero-one problem | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory |
-
Modeling and solving the angular constrained minimum spanning tree problem
Cunha, Alexandre Salles da, (2019)
-
Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm
Xing, Yanfeng, (2012)
-
Hosseinian, Seyedmohammadhossein, (2020)
- More ...
-
Decorous combinatorial lower bounds for row layout problems
Dahlbeck, Mirko, (2020)
-
Exact approaches for the combined cell layout problem
Dahlbeck, Mirko, (2023)
-
Fischer, Anja, (1996)
- More ...