Refined MDP-based branche-and-fix algorithm for the Hamiltonian cycle problem
Year of publication: |
2009
|
---|---|
Authors: | Ejov, Vladimir ; Filar, Jerzy A. ; Haythorpe, Michael ; Nguyen, Giang T. |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 34.2009, 3, p. 758-768
|
Subject: | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
A review of methods and algorithms for optimizing construction scheduling
Zhou, J., (2013)
-
A polyhedral description of kernels
Chen, Qin, (2016)
-
On the query complexity of Black-Peg AB-mastermind
Ouali, Mourad el, (2018)
- More ...
-
Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem
Ejov, Vladimir, (2009)
-
Hamiltonian Cycle Problem and Markov Chains
Borkar, Vivek S., (2012)
-
Genetic Theory for Cubic Graphs
Baniasadi, Pouya, (2016)
- More ...