Search Results - "Mixed-integer programming solvers"

Configuring Mixed-Integer Programming Solvers for Large-Scale Instances by Kemminer, Robin, Lange, Jannick, Kempkes, Jens Peter, Tierney, Kevin, Weiß, Dimitri

“…Algorithm configuration techniques automatically search for parameters of solvers and algorithms that provide minimal runtime or maximal solution quality on…”
Get full text

Machine learning for combinatorial optimization: A methodological tour d’horizon by Bengio, Yoshua, Lodi, Andrea, Prouvost, Antoine

“…•This paper surveys the recent attempts, both from the machine learning and operations research communities, at leveraging machine learning to solve…”
Get full text

Should We Stop Developing Heuristics and Only Rely on Mixed Integer Programming Solvers in Automated Test Assembly? A Rejoinder to van der Linden and Li (2016) by Chen, Pei-Hua

“…This rejoinder responds to the commentary by van der Linden and Li entiled “Comment on Three-Element Item Selection Procedures for Multiple Forms Assembly: An…”
Get full text

Data Mining Approach for Feature Based Parameter Tunning for Mixed-Integer Programming Solvers by Boas, Matheus G. Vilas, Santos, Haroldo G., Martins, Rafael de S.O., Merschmann, Luiz H.C.

“…Integer Programming (IP) is the most successful technique for solving hard combinatorial optimization problems. Modern IP solvers are very complex programs…”
Get full text

MIP-DD: A Delta Debugger for Mixed Integer Programming Solvers by Hoen, Alexander, Kamp, Dominik, Ambros Gleixner

“…The recent performance improvements in mixed-integer programming (MIP) went along with a significantly increased complexity of the codes of MIP solvers, which…”
Get full text

Ten years of feasibility pump, and counting by Berthold, Timo, Lodi, Andrea, Salvagnin, Domenico

“…The Feasibility Pump (fp) is probably the best-known primal heuristic for mixed-integer programming. The original work by Fischetti et al. (Math Program…”
Get full text

How important are branching decisions: Fooling MIP solvers by Le Bodic, Pierre, Nemhauser, George L.

“…-and-bound tree, but for which state-of-the-art Mixed Integer Programming solvers need an increasing amount of resources…”
Get full text

A note on modeling multiple choice requirements for simple mixed integer programming solvers by Ogryczak, Włodzimierz

“…This note introduces the Special Ordered Inequalities (SOI) as a new technique for integer programming modeling of multiple choice requirements and piecewise…”
Get full text

Constrained Mixed Integer Programming Solver Based on the Compact Genetic Algorithm by Palhares, P. H. S., Brito, L. C.

“…This paper presents a solver, the PIMAGc, for optimization of constrained mixed integer programming problems based on the Compact Genetic Algorithm (cGA). As…”
Get full text

Metaheuristic search based methods for unit commitment by Rahman, Dewan Fayzur, Viana, Ana, Pedroso, João Pedro

“…)heuristics with mixed integer programming solvers, in order to speed up convergence to optimality for large scale instances…”
Get full text

FATCOP 2.0: Advanced Features in an Opportunistic Mixed Integer Programming Solver by Chen, Qun, Ferris, Michael C., Linderoth, Jeff

“…We describe FATCOP 2.0, a new parallel mixed integer program solver that works in an opportunistic computing environment provided by the Condor resource…”
Get full text

Solving a dynamic facility location problem with partial closing and reopening by Jena, Sanjay Dominik, Cordeau, Jean-François, Gendron, Bernard

“…Motivated by an industrial application, we consider a recently introduced multi-period facility location problem with multiple commodities and multiple…”
Get full text

Solution algorithms for dock scheduling and truck sequencing in cross-docks: A neural branch-and-price and a metaheuristic by Monemi, Rahimeh Neamatian, Gelareh, Shahin, Maculan, Nelson

“… Many existing models for variations of this problem in the literature rely on big-M constraints, known for their poor performance when applied to general-purpose mixed-integer programming solvers…”
Get full text

Extensions for Benders cuts and new valid inequalities for solving the European day-ahead electricity market clearing problem efficiently by Ceyhan, Gökhan, Köksalan, Murat, Lokman, Banu

“…•There may not exist uniform prices in day-ahead electricity markets.•Market operators aim for partial-equilibrium solutions.•Pricing variables are associated…”
Get full text

FATCOP: A Fault Tolerant Condor-PVM Mixed Integer Programming Solver by Chen, Qun, Ferris, Michael C.

“…We describe FATCOP, a new parallel mixed integer program solver written in PVM. The implementation uses the Condor resource management system to provide a…”
Get full text

The MiniZinc Challenge 2008–2013 by Stuckey, Peter J., Feydy, Thibaut, Schutt, Andreas, Tack, Guido, Fischer, Julien

“…‐programming solvers, mixed integer programming solvers, SAT and SAT modulo theory solvers, and hybrid solvers…”
Get full text

Enhancing large neighbourhood search heuristics for Benders’ decomposition by Maher, Stephen J.

“…A general enhancement of the Benders’ decomposition (BD) algorithm can be achieved through the improved use of large neighbourhood search heuristics within mixed-integer programming solvers…”
Get full text

Optimal schedule recovery for the aircraft gate assignment with constrained resources by Asadi, Ehsan, Schultz, Michael, Fricke, Hartmut

“…•Hybrid Shuffled Frog-Leaping Algorithm and Grasshopper Optimization Algorithm.•RCPSP and Job-shop scheduling model.•Aircraft turnaround time and gate…”
Get full text

A fix-and-optimize matheuristic for university timetabling by Lindahl, Michael, Sørensen, Matias, Stidsen, Thomas R.

“… These soft constraints can have attributes that make it difficult for mixed-integer programming solvers to find good solutions fast enough to be used in a practical setting…”
Get full text

Techniques for accelerating branch-and-bound algorithms dedicated to sparse optimization by Samain, Gwenaël, Bourguignon, Sébastien, Ninin, Jordan

“… algorithms clearly outperform generic mixed-integer-programming solvers. Three acceleration techniques are proposed for such algorithms…”
Get full text