Pages that link to "Item:Q524882"
From MaRDI portal
The following pages link to Proximity search for 0--1 mixed-integer convex programming (Q524882):
Displaying 27 items.
- Single-commodity robust network design problem: complexity, instances and heuristic solutions (Q296864) (← links)
- ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design (Q342390) (← links)
- Inexact feasibility pump for mixed integer nonlinear programming (Q344569) (← links)
- Proximity search for 0--1 mixed-integer convex programming (Q524882) (← links)
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs (Q683326) (← links)
- Deep neural networks and mixed integer linear optimization (Q1617390) (← links)
- Solving MIPs via scaling-based augmentation (Q1662107) (← links)
- Adaptive kernel search: a heuristic for solving mixed integer linear programs (Q1694819) (← links)
- Thinning out Steiner trees: a node-based model for uniform edge costs (Q1699615) (← links)
- Machine learning meets mathematical optimization to predict the optimal production of offshore wind parks (Q1734857) (← links)
- A proximal-point outer approximation algorithm (Q2023688) (← links)
- On the optimized design of next-generation wind farms (Q2030647) (← links)
- Generalized relax-and-fix heuristic (Q2108128) (← links)
- Adaptive large neighborhood search for mixed integer programming (Q2146445) (← links)
- A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times (Q2148147) (← links)
- Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families (Q2158015) (← links)
- Safe distancing in the time of COVID-19 (Q2171551) (← links)
- Finding a portfolio of near-optimal aggregated solutions to capacity expansion energy system models (Q2225646) (← links)
- Structure-driven fix-and-propagate heuristics for mixed integer programming (Q2295978) (← links)
- Applications of mathematics to maritime search (Q2321650) (← links)
- Ten years of feasibility pump, and counting (Q2329705) (← links)
- Mathematical programming based heuristics for the 0--1 MIP: a survey (Q2401328) (← links)
- A matheuristic for the robust integrated airline fleet assignment, aircraft routing, and crew pairing problem (Q2669651) (← links)
- The transportation problem with packing constraints (Q6106585) (← links)
- A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem (Q6164361) (← links)
- The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem (Q6164609) (← links)
- Feasibility jump: an LP-free Lagrangian MIP heuristic (Q6175707) (← links)