Undercover: a primal MINLP heuristic exploring a largest sub-MIP

We present Undercover, a primal heuristic for nonconvex mixed-integer nonlinear programs (MINLPs) that explores a mixed-integer linear subproblem (sub-MIP) of a given MINLP. We solve a vertex covering problem to identify a smallest set of variables to fix, a so-called cover , such that each constrai...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematical programming Ročník 144; číslo 1-2; s. 315 - 346
Hlavní autoři:	Berthold, Timo, Gleixner, Ambros M.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2014 Springer Nature B.V
Témata:	Algorithms Analysis Calculus of Variations and Optimal Control; Optimization Combinatorics Complement Domain propagation Full Length Paper Heuristic Integer programming Linear programming Mathematical analysis Mathematical and Computational Physics Mathematical Methods in Physics Mathematical models Mathematics Mathematics and Statistics Mathematics of Computing Neighborhoods Numerical Analysis Optimization Solvers State of the art Studies Theoretical Variables 90C20 Primal heuristic Nonconvex optimization 90C30 Mixed-integer nonlinear programming Large neighborhood search 90C11 90C26 90C59 Mixed-integer quadratically constrained programming
ISSN:	0025-5610, 1436-4646
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!