📣 Try out the NEW Gateway to Research and let us know what you think.

We're looking for users to test the new service during August and September and share their feedback. Express your interest by completing this short form.

Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics (2021)

First Author: Bäckström C

Attributed to: Next Generation of Algorithms for Mixed Integer Linear Programming (MILP) funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1613/jair.1.12278

Publication URI: http://dx.doi.org/10.1613/jair.1.12278

Type: Journal Article/Review

Parent Publication: Journal of Artificial Intelligence Research