Proximity search for 0--1 mixed-integer convex programming
From MaRDI portal
Publication:524882
DOI10.1007/s10732-014-9266-xzbMath1360.90173OpenAlexW1974166590MaRDI QIDQ524882
Michele Monaci, Matteo Fischetti
Publication date: 26 April 2017
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-014-9266-x
Convex programming (90C25) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)
Related Items
Deep neural networks and mixed integer linear optimization, Single-commodity robust network design problem: complexity, instances and heuristic solutions, Adaptive large neighborhood search for mixed integer programming, A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times, Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families, ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design, Inexact feasibility pump for mixed integer nonlinear programming, Solving MIPs via scaling-based augmentation, Mathematical programming based heuristics for the 0--1 MIP: a survey, Safe distancing in the time of COVID-19, A matheuristic for the robust integrated airline fleet assignment, aircraft routing, and crew pairing problem, The transportation problem with packing constraints, Adaptive kernel search: a heuristic for solving mixed integer linear programs, A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem, The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem, Feasibility jump: an LP-free Lagrangian MIP heuristic, Thinning out Steiner trees: a node-based model for uniform edge costs, Finding a portfolio of near-optimal aggregated solutions to capacity expansion energy system models, Machine learning meets mathematical optimization to predict the optimal production of offshore wind parks, Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs, Proximity search for 0--1 mixed-integer convex programming, A proximal-point outer approximation algorithm, Four Good Reasons to Use an Interior Point Solver Within a MIP Solver, On the optimized design of next-generation wind farms, Structure-driven fix-and-propagate heuristics for mixed integer programming, Applications of mathematics to maritime search, Ten years of feasibility pump, and counting, Generalized relax-and-fix heuristic
Uses Software
Cites Work
- Unnamed Item
- Proximity search for 0--1 mixed-integer convex programming
- A feasibility pump for mixed integer nonlinear programs
- Local branching
- Exploring relaxation induced neighborhoods to improve MIP solutions
- A storm of feasibility pumps for nonconvex MINLP
- Measuring the impact of primal heuristics
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- Parametric tabu-search for mixed integer programs
- The feasibility pump
- On a primal-proximal heuristic in discrete optimization
- An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
- On cut-based inequalities for capacitated network design polyhedra
- Support Vector Machines with the Ramp Loss and the Hard Margin Loss
- Numerical Optimization
- A New Approach to the Feasibility Pump in Mixed Integer Programming
- Rounding and Propagation Heuristics for Mixed Integer Programming
- MIP‐and‐refine matheuristic for smart grid energy management
