Find link

language:

Find link is a tool written by Edward Betts.

searching for Branch and cut 14 found (36 total)

Egon Balas (702 words) [view diff] no match in snippet view article find links to article

Ceria, G. Cornuéjols: Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework, Management Science 42, 1996; 1229–1246. E. Balas: The Prize

Hashiwokakero (782 words) [view diff] no match in snippet view article find links to article

Laporte, G.; Lindbeck, A.; Vidal, T. (2019), "Benchmark instances and branch-and-cut algorithm for the Hashiwokakero puzzle", arXiv:1905.00973 [cs.DM]. Wikimedia

HiGHS optimization solver (1,138 words) [view diff] no match in snippet view article find links to article

regularly reported using industry-standard benchmarks. HiGHS has a branch-and-cut solver for MIP problems. Its performance relative to commercial and

Petra Mutzel (592 words) [view diff] no match in snippet view article find links to article

ground states of Ising spin glasses: New experimental results with a branch-and-cut algorithm", Journal of Statistical Physics, 80 (1–2): 487–496, Bibcode:1995JSP

Layered graph drawing (2,239 words) [view diff] no match in snippet view article find links to article

Minimizing the width of the widest layer is NP-hard but may be solved by branch-and-cut or approximated heuristically. Alternatively, the problem of minimizing

Multiple sequence alignment (6,213 words) [view diff] no match in snippet view article find links to article

PMID 7804875. Althaus E, Caprara A, Lenhof HP, Reinert K (2006). "A branch-and-cut algorithm for multiple sequence alignment". Mathematical Programming

Steiner travelling salesman problem (358 words) [view diff] no match in snippet view article find links to article

Programming, 33(1):1–27, 1985. S. Borne, A.R. Mahjoub, and R. Taktak. A branch-and-cut algorithm for the multiple steiner TSP with order constraints. Electronic

Equitable coloring (2,290 words) [view diff] case mismatch in snippet view article find links to article

Combinatorial Conference 1973, Cambridge, UK: Cambridge Univ. Press, pp. 201–202. ECOPT A Branch and Cut algorithm for solving the Equitable Coloring Problem

Bin packing problem (6,986 words) [view diff] no match in snippet view article find links to article

Completion on non-trivial problems with 100 items, and outperforms the BCP (branch-and-cut-and-price) algorithm by Belov and Scheithauer on problems that have

Sparse PCA (2,239 words) [view diff] no match in snippet view article find links to article

formulation framework. A certifiably optimal mixed-integer semidefinite branch-and-cut approach The methodological and theoretical developments of Sparse PCA

Minimum-weight triangulation (3,289 words) [view diff] no match in snippet view article find links to article

Yoshiaki; Imai, Keiko; Takeuchi, Fumihiko; Tajima, Akira (1997), "A branch-and-cut approach for minimum weight triangulation", Algorithms and Computation

Ring star problem (741 words) [view diff] no match in snippet view article find links to article

"The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm". Discrete Applied Mathematics. 159 (16): 1901–1914. doi:10

Open energy system models (24,110 words) [view diff] case mismatch in snippet view article find links to article

Software List of free and open-source optimization solvers Cbc (COIN-OR Branch and Cut) – an open source optimization solver Clp (COIN-OR LP) – an open source

MiniZinc (378 words) [view diff] no match in snippet view article find links to article

doi:10.1007/978-3-540-74970-7_38. ISBN 978-3-540-74970-7. "COIN-OR Branch-and-Cut MIP Solver". projects.coin-or.org. Retrieved 2020-09-14. "Choco-solver"