REVIEW 1 cited by
Combining heuristics and Exact Algorithms: A Review
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
Signed reviews
read the original abstract
Several different ways exist for approaching hard optimization problems. Mathematical programming techniques, including (integer) linear programming-based methods and metaheuristic approaches, are two highly successful streams for combinatorial problems. These two have been established by different communities more or less in isolation from each other. Only over several years ago, a larger number of researchers recognized the advantages and huge potentials of building hybrids of mathematical programming methods and metaheuristics.
Forward citations
Cited by 1 Pith paper
-
Not All Problems Are Best Modeled as MILP: A DSL-Centric Framework for Flexible and Accurate Optimization Modeling
OptiDSL maps optimization problem descriptions to domain-specific language templates and reports large gains over MILP-based LLM formulation pipelines, with the caveat that its headline benchmark is self-generated.
Discussion (0). Continue with ORCID to comment.