Integer optimization by local search. A domain-independent approach
From MaRDI portal
Publication:1301506
zbMath0934.90053MaRDI QIDQ1301506
Publication date: 5 September 1999
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
integer programmingbranch and boundheuristicpropositional satisfiabilityconstrained programminginteger local search
Applications of mathematical programming (90C90) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90) Boolean programming (90C09)
Related Items (13)
Filtering algorithms for the multiset ordering constraint ⋮ Reduced order models for random functions. Application to stochastic problems ⋮ Generic incremental algorithms for local search ⋮ Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings ⋮ On solving the progressive party problem as a MIP. ⋮ Propagation algorithms for lexicographic ordering constraints ⋮ MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability ⋮ Shift-and-propagate ⋮ Evaluating the impact of AND/OR search on 0-1 integer linear programming ⋮ A novel analytical integer optimization method for wavelet based subband coding ⋮ Stochastic reduced-order models for stable nonlinear ordinary differential equations ⋮ Revisiting constraint-directed search ⋮ Scheduling the professional soccer leagues of Austria and Germany
Uses Software
This page was built for publication: Integer optimization by local search. A domain-independent approach
