Pith. sign in

REVIEW 1 cited by

Boosting Combinatorial Problem Modeling with Machine Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1807.05517 v1 pith:RUMTGENQ submitted 2018-07-15 cs.AI

classification cs.AI
keywords modelinglearningoptimizationmachineproblemapproachesareabeen
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In the past few years, the area of Machine Learning (ML) has witnessed tremendous advancements, becoming a pervasive technology in a wide range of applications. One area that can significantly benefit from the use of ML is Combinatorial Optimization. The three pillars of constraint satisfaction and optimization problem solving, i.e., modeling, search, and optimization, can exploit ML techniques to boost their accuracy, efficiency and effectiveness. In this survey we focus on the modeling component, whose effectiveness is crucial for solving the problem. The modeling activity has been traditionally shaped by optimization and domain experts, interacting to provide realistic results. Machine Learning techniques can tremendously ease the process, and exploit the available data to either create models or refine expert-designed ones. In this survey we cover approaches that have been recently proposed to enhance the modeling process by learning either single constraints, objective functions, or the whole model. We highlight common themes to multiple approaches and draw connections with related fields of research.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits

    quant-ph 2025-02 conditional novelty 6.0 of 10

    A quantum dynamic programming circuit prepares the uniform superposition of all Hamiltonian cycles in polynomial gates, reducing Grover-based TSP search complexity to O(sqrt((N-1)!).

Pith tools