Pages that link to "Item:Q1769074"
From MaRDI portal
The following pages link to Exploring relaxation induced neighborhoods to improve MIP solutions (Q1769074):
Displayed 33 items.
- A computational study of parametric tabu search for 0-1 mixed integer programs (Q709185) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Testing cut generators for mixed-integer linear programming (Q734353) (← 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)
- The traveling tournament problem with predefined venues (Q2268523) (← links)
- New convergent heuristics for 0-1 mixed integer programming (Q2378374) (← links)
- Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder (Q2378418) (← links)
- Repairing MIP infeasibility through local branching (Q2459381) (← links)
- Scheduling United States Coast Guard helicopter deployment and maintenance at Clearwater Air Station, Florida (Q2462531) (← links)
- Conflict analysis in mixed integer programming (Q2471271) (← links)
- A feasibility pump heuristic for general mixed-integer problems (Q2471275) (← links)
- Improving the feasibility pump (Q2471276) (← links)
- The feasibility pump (Q2571001) (← links)
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs (Q2654395) (← links)
- Solution approaches to large shift scheduling problems (Q3539809) (← links)
- A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs (Q5387645) (← links)