Ghent University Academic Bibliography

Your filters: cql: keyword exact "Combinatorial optimization"

Add to list
- Journal Article
- A1
- open access
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions

Jorik Jooken, Pieter Leyman (UGent) and Patrick De Causmaecker

(2023) EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. 311(1). p.36-55
Add to list
- Journal Article
- A1
- open access
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems

Jorik Jooken, Pieter Leyman (UGent) , Tony Wauters and Patrick De Causmaecker

(2023) COMPUTERS & OPERATIONS RESEARCH. 150.
Add to list
- Journal Article
- A1
- open access
Parliament seating assignment problems

Bart Vangerven (UGent) , Dirk Briskorn, Dries Goossens (UGent) and Frits C.R. Spieksma

(2022) EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. 296(3). p.914-926
Add to list
Time-multiplexed optical systems for reservoir computing and coherent Ising machines

G. Van der Sande, F. Bohm, K. Harkhoe, J. Pauwels, Peter Bienstman (UGent) , T. Van Vaerenbergh and G. Verschaffelt

(2021) PROCEEDINGS OF THE SOCIETY OF PHOTO-OPTICAL INSTRUMENTATION ENGINEERS (SPIE). In Emerging Topics in Artificial Intelligence (ETAI) 11804.
Add to list
On the resource renting problem with overtime

Louis-Philippe Kerkhove (UGent) , Mario Vanhoucke (UGent) and Broos Maenhout (UGent)

(2017) COMPUTERS & INDUSTRIAL ENGINEERING. 111(111). p.303-319
Add to list
- Conference Paper
- C3
Dynamic programming for combinatorial auctions with items arranged on rows

Bart Vangerven, Dries Goossens (UGent) and Frits Spieksma

(2015) 29th Annual conference of the Belgian Operations Research Society, Abstracts. p.130-131
Add to list
Countering the negative search bias of Ant Colony Optimization in subset selection problems

Jan Verwaeren (UGent) , Karolien Scheerlinck and Bernard De Baets (UGent)

(2013) COMPUTERS & OPERATIONS RESEARCH. 40(4). p.931-942
Add to list
Search combinators

Tom Schrijvers (UGent) , Guido Tack, Pieter Wuille, Horst Samulowitz and Peter J Stuckey

(2011) Lecture Notes in Computer Science. 6876. p.774-788
Add to list
Cutting path optimization using tabu search

Reginald Dewil, Pieter Vansteenwegen (UGent) and Dirk Cattrysse

(2011) Key Engineering Materials. 473. p.739-748
Add to list
- Journal Article
- A1
Fast SDP relaxations of graph cut clustering, transduction, and other combinatorial problems

Tijl De Bie (UGent) and Nello Cristianini

(2006) JOURNAL OF MACHINE LEARNING RESEARCH. 7. p.1409-1436

Academic Bibliography

Features for the 0-1 knapsack problem based on inclusionwise maximal solutions

Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems

Parliament seating assignment problems

Time-multiplexed optical systems for reservoir computing and coherent Ising machines

On the resource renting problem with overtime

Dynamic programming for combinatorial auctions with items arranged on rows

Countering the negative search bias of Ant Colony Optimization in subset selection problems

Search combinators

Cutting path optimization using tabu search

Fast SDP relaxations of graph cut clustering, transduction, and other combinatorial problems

Contents

Support

Contact