Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Core-guided and core-boosted search for CP

From MaRDI portal
Publication:2110407
Jump to:navigation, search

DOI10.1007/978-3-030-58942-4_14OpenAlexW3087538456MaRDI QIDQ2110407

Emir Demirović, Peter J. Stuckey, Graeme Gange, Jeremias Berg

Publication date: 21 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-58942-4_14



Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx)


Related Items (3)

Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations ⋮ Coupling different integer encodings for SAT ⋮ Boosting branch-and-bound MaxSAT solvers with clause learning






This page was built for publication: Core-guided and core-boosted search for CP

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2110407&oldid=14606339"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 22:17.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki