Pages that link to "Item:Q1769074"
From MaRDI portal
The following pages link to Exploring relaxation induced neighborhoods to improve MIP solutions (Q1769074):
Displaying 50 items.
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration (Q1652297) (← links)
- A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines (Q1652346) (← links)
- Guided dive for the spatial branch-and-bound (Q1675571) (← links)
- Adaptive kernel search: a heuristic for solving mixed integer linear programs (Q1694819) (← links)
- An ILP-based local search procedure for the VRP with pickups and deliveries (Q1698289) (← links)
- Generation of feasible integer solutions on a massively parallel computer using the feasibility pump (Q1728378) (← links)
- Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials (Q1737490) (← links)
- Generalized local branching heuristics and the capacitated ring tree problem (Q1744240) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design (Q1754304) (← links)
- An efficient matheuristic for offline patient-to-bed assignment problems (Q1754343) (← links)
- MIP formulations and heuristics for two-level production-transportation problems (Q1761227) (← links)
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem (Q1761940) (← links)
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (Q1761941) (← links)
- Rounding-based heuristics for nonconvex MINLPS (Q1762458) (← links)
- A dual heuristic for mixed integer programming (Q1785392) (← links)
- Preprocessing and cutting planes with conflict graphs (Q2027062) (← links)
- A constraints-aware reweighted feasibility pump approach (Q2060346) (← links)
- On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs (Q2064299) (← links)
- Finding the maximum multi improvement on neighborhood exploration (Q2070118) (← links)
- Generalized relax-and-fix heuristic (Q2108128) (← links)
- Bi-objective facility location under uncertainty with an application in last-mile disaster relief (Q2108809) (← links)
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization (Q2114818) (← links)
- Advancing local search approximations for multiobjective combinatorial optimization problems (Q2125231) (← links)
- Optimization-based dispatching policies for open-pit mining (Q2129198) (← links)
- Inversion of convection-diffusion equation with discrete sources (Q2129202) (← links)
- A supervised learning-driven heuristic for solving the facility location and production planning problem (Q2140228) (← links)
- Adaptive large neighborhood search for mixed integer programming (Q2146445) (← links)
- Bounds on the objective value of feasible roundings (Q2189630) (← links)
- HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry (Q2256197) (← links)
- A primal heuristic for optimizing the topology of gas networks based on dual information (Q2260914) (← links)
- The traveling tournament problem with predefined venues (Q2268523) (← links)
- A solution approach for optimizing long- and short-term production scheduling at LKAB's kiruna mine (Q2275613) (← links)
- Structure-driven fix-and-propagate heuristics for mixed integer programming (Q2295978) (← links)
- Granularity in nonlinear mixed-integer optimization (Q2302751) (← links)
- An efficient train scheduling algorithm on a single-track railway system (Q2327960) (← links)
- Fair ticket pricing in public transport as a constrained cost allocation game (Q2341202) (← links)
- A set covering approach for multi-depot train driver scheduling (Q2343986) (← links)
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs (Q2352416) (← links)
- A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design (Q2357911) (← links)
- Power efficient uplink scheduling in SC-FDMA: benchmarking by column generation (Q2358072) (← links)
- A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q2359136) (← links)
- Three ideas for a feasibility pump for nonconvex MINLP (Q2361121) (← 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)
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs (Q2393650) (← links)
- Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints (Q2397760) (← links)
- Mathematical programming based heuristics for the 0--1 MIP: a survey (Q2401328) (← links)
- Feasibility Pump-like heuristics for mixed integer problems (Q2448898) (← links)
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP (Q2452383) (← links)
