Local-MIP: efficient local search for mixed integer programming
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3637601 (Why is no real title available?)
- scientific article; zbMATH DE number 1302201 (Why is no real title available?)
- An automatic method for solving discrete programming problems
- Benchmarks for basic scheduling problems
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Branch-and-Bound Methods: A Survey
- Choosing probability distributions for stochastic local search and the role of make versus break
- Clause weighting local search for SAT
- Efficient local search for pseudo Boolean optimization
- Enabling research through the SCIP Optimization Suite 8.0
- Exploiting the power of MIP solvers in MAXSAT
- Feasibility jump: an LP-free Lagrangian MIP heuristic
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- Integrating multi-armed bandit with local search for MaxSAT
- Local Search for SMT on Linear Integer Arithmetic
- Local search algorithms for SAT: an empirical evaluation
- Local search for Boolean satisfiability with configuration checking and subscore
- LocalSolver 1.x: A black-box local-search solver for 0-1 programming
- MIP formulations for induced graph optimization problems: a tutorial
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- Mixed integer linear programming in process scheduling: modeling, algorithms, and applications
- Mixed integer programming models for job shop scheduling: A computational analysis
- Mixed integer programming: analyzing 12 years of progress
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- Parallelizing the dual revised simplex method
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Production Planning by Mixed Integer Programming
- Reducibility among combinatorial problems
- SCIP: solving constraint integer programs
- Scoring functions based on second level score for k-SAT with long clauses
- Shift-and-propagate
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- Teaching Integer Programming Formulations Using the Traveling Salesman Problem
- The feasibility pump
- The generalized simplex method for minimizing a linear form under linear inequality restraints
- ``Outline of an algorithm for integer solutions to linear programs and ``An algorithm for the mixed integer problem
This page was built for publication: Local-MIP: efficient local search for mixed integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6916822)
