Pages that link to "Item:Q1769074"
From MaRDI portal
The following pages link to Exploring relaxation induced neighborhoods to improve MIP solutions (Q1769074):
Displayed 50 items.
- Integer programming techniques for the nurse rostering problem (Q284423) (← links)
- A heuristic for BILP problems: the single source capacitated facility location problem (Q296777) (← links)
- Decomposition based hybrid metaheuristics (Q319285) (← links)
- An effective matheuristic for the capacitated total quantity discount problem (Q336744) (← links)
- Model-based automatic neighborhood design by unsupervised learning (Q337347) (← links)
- Fix-and-relax approaches for controlled tabular adjustment (Q337507) (← links)
- The air-cargo consolidation problem with pivot weight: models and solution methods (Q337525) (← links)
- ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design (Q342390) (← links)
- Integrating matheuristics and metaheuristics for timetabling (Q342465) (← links)
- Inexact feasibility pump for mixed integer nonlinear programming (Q344569) (← links)
- A recipe for finding good solutions to MINLPs (Q384810) (← links)
- An efficient heuristic algorithm for the capacitated \(p\)-median problem (Q385459) (← links)
- A set-covering based heuristic algorithm for the periodic vehicle routing problem (Q406496) (← links)
- Heuristics for convex mixed integer nonlinear programs (Q429468) (← links)
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem (Q439317) (← links)
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times (Q439552) (← links)
- Boosting the feasibility pump (Q495939) (← links)
- An algorithm for approximating the Pareto set of the multiobjective set covering problem (Q513581) (← links)
- Bounding, filtering and diversification in CP-based local branching (Q519096) (← links)
- Proximity search for 0--1 mixed-integer convex programming (Q524882) (← links)
- Shift-and-propagate (Q524884) (← links)
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem (Q542002) (← links)
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs (Q683326) (← links)
- Polylithic modeling and solution approaches using algebraic modeling systems (Q691438) (← links)
- A computational study of parametric tabu search for 0-1 mixed integer programs (Q709185) (← links)
- A Lagrangian heuristic for satellite range scheduling with resource constraints (Q716351) (← links)
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming (Q721171) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Testing cut generators for mixed-integer linear programming (Q734353) (← links)
- Restrict-and-relax search for 0-1 mixed-integer programs (Q743638) (← links)
- RENS. The optimal rounding (Q744216) (← links)
- Integer-programming software systems (Q817202) (← links)
- MIR closures of polyhedral sets (Q847821) (← links)
- Two local search approaches for solving real-life car sequencing problems (Q932212) (← links)
- Soft car sequencing with colors: lower bounds and optimality proofs (Q932214) (← links)
- Nonconvex, lower semicontinuous piecewise linear optimization (Q951120) (← links)
- A heuristic approach for big bucket multi-level production planning problems (Q958084) (← links)
- Alternating control tree search for knapsack/covering problems (Q972644) (← links)
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs (Q985305) (← links)
- An ILP improvement procedure for the open vehicle routing problem (Q991364) (← links)
- A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem (Q992649) (← links)
- A trust branching path heuristic for zero-one programming (Q1014935) (← links)
- Solving multiple scenarios in a combinatorial auction (Q1017447) (← links)
- Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
- Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem (Q1040083) (← links)
- Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants (Q1040968) (← links)
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem (Q1042147) (← links)
- Feasibility pump 2.0 (Q1043854) (← links)
- Optimizing production and transportation in a commit-to-delivery business mode (Q1046062) (← links)
- Matheuristics for the single-path design-balanced service network design problem (Q1652031) (← links)