Zobrazeno 1 - 10
of 98
pro vyhledávání: '"Hurkens, C.A.J."'
Publikováno v:
In Computers and Operations Research April 2020 116
Autor:
De Bontridder, K.M.J., Halldórsson, B.V., Halldórsson, M.M., Hurkens, C.A.J., Lenstra, J.K., Ravi, R., Stougie, L.
Publikováno v:
In Operations Research Letters January 2021 49(1):62-68
Publikováno v:
In European Journal of Operational Research 2005 163(3):706-720
Autor:
Hurkens, C.A.J.
Publikováno v:
STAtOR, 2017(2), 29-32
Benders decompositie is een methode om lastige of grote problemen aan te pakken op basis van een geschikte partitie van de variabelen. In dit artikel beschouwen we een praktisch probleem waarbij de partitie zich vanzelf opdringt. Het betreft het zoge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::a2edd0efb9aa12c76feb6a60254cd4d7
https://research.tue.nl/nl/publications/f6a82707-3b07-4056-ab5b-b7b1a3fb9a53
https://research.tue.nl/nl/publications/f6a82707-3b07-4056-ab5b-b7b1a3fb9a53
Publikováno v:
INFORMS Journal on Computing. Spring2000, Vol. 12 Issue 2, p111. 14p. 3 Diagrams.
Publikováno v:
Algorithmic Aspects in Information and Management (6th International Conference, AAIM 2010, Weihai, China, July 19-21, 2010. Proceedings), 229-242
STARTPAGE=229;ENDPAGE=242;TITLE=Algorithmic Aspects in Information and Management (6th International Conference, AAIM 2010, Weihai, China, July 19-21, 2010. Proceedings)
Algorithmic Aspects in Information and Management ISBN: 9783642143540
AAIM
STARTPAGE=229;ENDPAGE=242;TITLE=Algorithmic Aspects in Information and Management (6th International Conference, AAIM 2010, Weihai, China, July 19-21, 2010. Proceedings)
Algorithmic Aspects in Information and Management ISBN: 9783642143540
AAIM
We consider the problem of deciding whether a given directed graph can be vertex partitioned into two acyclic subgraphs. Applications of this problem include testing rationality of collective consumption behavior, a subject in micro-economics. We ide
Publikováno v:
Pure TUe
SIAM Journal on Discrete Mathematics, 21(2), 482-503
Hurkens, C A J, Keijsper, J C M & Stougie, L 2007, ' Virtual private network design : a proof of the tree routing conjecture on ring networks ', SIAM Journal on Discrete Mathematics, vol. 21, no. 2, pp. 482-503 . https://doi.org/10.1137/050626259
SIAM Journal on Discrete Mathematics, 21(2), 482-503. Society for Industrial and Applied Mathematics Publications
Integer Programming and Combinatorial Optimization ISBN: 9783540261995
IPCO
SIAM Journal on Discrete Mathematics, 21(2), 482-503. Society for Industrial and Applied Mathematics (SIAM)
Integer Programming and Combinatorial Optimization (Proceedings 11th International Conference, IPCO 2005, Berlin, Germany, June 8-10, 2005), 407-421
STARTPAGE=407;ENDPAGE=421;TITLE=Integer Programming and Combinatorial Optimization (Proceedings 11th International Conference, IPCO 2005, Berlin, Germany, June 8-10, 2005)
SIAM Journal on Discrete Mathematics, 21(2), 482-503
Hurkens, C A J, Keijsper, J C M & Stougie, L 2007, ' Virtual private network design : a proof of the tree routing conjecture on ring networks ', SIAM Journal on Discrete Mathematics, vol. 21, no. 2, pp. 482-503 . https://doi.org/10.1137/050626259
SIAM Journal on Discrete Mathematics, 21(2), 482-503. Society for Industrial and Applied Mathematics Publications
Integer Programming and Combinatorial Optimization ISBN: 9783540261995
IPCO
SIAM Journal on Discrete Mathematics, 21(2), 482-503. Society for Industrial and Applied Mathematics (SIAM)
Integer Programming and Combinatorial Optimization (Proceedings 11th International Conference, IPCO 2005, Berlin, Germany, June 8-10, 2005), 407-421
STARTPAGE=407;ENDPAGE=421;TITLE=Integer Programming and Combinatorial Optimization (Proceedings 11th International Conference, IPCO 2005, Berlin, Germany, June 8-10, 2005)
A basic question in virtual private network (VPN) design is if the symmetric version of the problem always has an optimal solution which is a tree network. An affirmative answer would imply that the symmetric VPN problem is solvable in polynomial tim
Autor:
Aardal, K.I., Bixby, R.E., Hurkens, C.A.J., Lenstra, A.K., Smeltink, J.W., Cornuéjols, C., Burkard, R.E., Woeginger, G.J.
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783540660194
IPCO
Integer Programming and Combinatorial Optimization (Proceedings 7th International IPCO Conference, Graz, Austria, June 9-11, 1999), 1-16
STARTPAGE=1;ENDPAGE=16;TITLE=Integer Programming and Combinatorial Optimization (Proceedings 7th International IPCO Conference, Graz, Austria, June 9-11, 1999)
IPCO
Integer Programming and Combinatorial Optimization (Proceedings 7th International IPCO Conference, Graz, Austria, June 9-11, 1999), 1-16
STARTPAGE=1;ENDPAGE=16;TITLE=Integer Programming and Combinatorial Optimization (Proceedings 7th International IPCO Conference, Graz, Austria, June 9-11, 1999)
At the IPCO VI conference CornuEjols and Dawande proposed a set of 0-1 linear programming instances that proved to be very hard to solve by traditional methods, and in particular by linear programming based branch-and-bound. They offered these market
Autor:
Bodlaender, M.H.L., Hurkens, C.A.J., Kusters, V.J.J., Staals, F., Woeginger, G.J., Zantema, H., Baeten, J.C.M., Ball, T., Boer, de, F.S.
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642334740
IFIP TCS
Theoretical Computer Science (7th IFIP TC 1/WG 2.2 International Conference, TCS 2012, Amsterdam, The Netherlands, September 26-28, 2012. Proceedings), 57-71
STARTPAGE=57;ENDPAGE=71;TITLE=Theoretical Computer Science (7th IFIP TC 1/WG 2.2 International Conference, TCS 2012, Amsterdam, The Netherlands, September 26-28, 2012. Proceedings)
IFIP TCS
Theoretical Computer Science (7th IFIP TC 1/WG 2.2 International Conference, TCS 2012, Amsterdam, The Netherlands, September 26-28, 2012. Proceedings), 57-71
STARTPAGE=57;ENDPAGE=71;TITLE=Theoretical Computer Science (7th IFIP TC 1/WG 2.2 International Conference, TCS 2012, Amsterdam, The Netherlands, September 26-28, 2012. Proceedings)
We investigate a combinatorial two-player game, in which one player wants to keep the behavior of an underlying water-bucket system stable whereas the other player wants to cause overflows. This game is motivated by data management applications in wi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e2d05406d81406748280d964c7d00e78
https://doi.org/10.1007/978-3-642-33475-7_5
https://doi.org/10.1007/978-3-642-33475-7_5
Autor:
Abbasi, N., Habibi, H., Hurkens, C.A.J., Klabbers, M.D., Tijsseling, A.S., Eijndhoven, van, S.J.L.
Publikováno v:
ASCE 14th Water Distribution Systems Analysis Conference (Adelaide, Australia, September 24-27, 2012), 758-766
STARTPAGE=758;ENDPAGE=766;TITLE=ASCE 14th Water Distribution Systems Analysis Conference (Adelaide, Australia, September 24-27, 2012)
STARTPAGE=758;ENDPAGE=766;TITLE=ASCE 14th Water Distribution Systems Analysis Conference (Adelaide, Australia, September 24-27, 2012)
Water distribution networks experience considerable losses due to leakage, often at multiple locations simultaneously. Leakage detection and localization based on sensor placement and online pressure monitoring could be fast and economical. Using the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::e570a5c29f6dd35674bd3ffa221910f6
https://research.tue.nl/nl/publications/faebb2cc-8f03-4244-aabb-f30fd5973bd8
https://research.tue.nl/nl/publications/faebb2cc-8f03-4244-aabb-f30fd5973bd8