Pages that link to "Item:Q1290617"

The following pages link to A Lagrangian-based heuristic for large-scale set covering problems (Q1290617):

Displaying 47 items.

• An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859) (← links)
• A hybrid heuristic for the set covering problem (Q373244) (← links)
• Exploring further advantages in an alternative formulation for the set covering problem (Q783157) (← links)
• An effective and simple heuristic for the set covering problem (Q853015) (← links)
• A mixed integer linear program and tabu search approach for the complementary edge covering problem (Q964367) (← links)
• Surrogate constraint normalization for the set covering problem (Q976352) (← links)
• Computational experience with general cutting planes for the set covering problem (Q1002077) (← links)
• Model-based view planning (Q1008495) (← links)
• Heuristics for the variable sized bin-packing problem (Q1017465) (← links)
• An adaptation of SH heuristic to the location set covering problem (Q1278140) (← links)
• Simple Lagrangian heuristic for the set covering problem (Q1278602) (← links)
• On some difficult linear programs coming from set partitioning (Q1348247) (← links)
• Algorithms for railway crew management (Q1365052) (← links)
• Solving large set covering problems for crew scheduling (Q1367686) (← links)
• The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation (Q1630276) (← links)
• Relaxation heuristics for the set multicover problem with generalized upper bound constraints (Q1652583) (← links)
• A binary cat swarm optimization algorithm for the non-unicost set covering problem (Q1666040) (← links)
• Improved handling of uncertainty and robustness in set covering problems (Q1695010) (← links)
• Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (Q1695015) (← links)
• Covering models and optimization techniques for emergency response facility location and planning: a review (Q1935907) (← links)
• A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem (Q1991205) (← links)
• A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) (← links)
• Avoiding redundant columns by adding classical Benders cuts to column generation subproblems (Q2019426) (← links)
• Efficient feature selection for logical analysis of large-scale multi-class datasets (Q2045033) (← links)
• A feasibility-ensured Lagrangian heuristic for general decomposable problems (Q2068837) (← links)
• Column generation extensions of set covering greedy heuristics (Q2102849) (← links)
• Dissecting the duality gap: the supporting hyperplane interpretation revisited (Q2119761) (← links)
• A theoretical justification of the set covering greedy heuristic of Caprara et al. (Q2172080) (← links)
• An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
• A new approach for solving set covering problem using jumping particle swarm optimization method (Q2311260) (← links)
• Solving the non-unicost set covering problem by using cuckoo search and black hole optimization (Q2311311) (← links)
• Primal convergence from dual subgradient methods for convex optimization (Q2340335) (← links)
• Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem (Q2379863) (← links)
• Cutting plane versus compact formulations for uncertain (integer) linear programs (Q2392865) (← links)
• Constrained 0-1 quadratic programming: basic approaches and extensions (Q2467302) (← links)
• A 3-flip neighborhood local search for the set covering problem (Q2490164) (← links)
• The set covering problem revisited: an empirical study of the value of dual information (Q2514674) (← links)
• Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism (Q2680785) (← links)
• A heuristic algorithm for the set covering problem (Q4645914) (← links)
• (Q4735035) (← links)
• A Heuristic Method for the Set Covering Problem (Q4950819) (← links)
• On Multiple Coverings of Fixed Size Containers with Non-Euclidean Metric by Circles of Two Types (Q4965106) (← links)
• The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic (Q5357751) (← links)
• An efficient mean field approach to the set covering problem (Q5943937) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)
• A binary monkey search algorithm variation for solving the set covering problem (Q6151196) (← links)
• A meta-heuristic extension of the Lagrangian heuristic framework (Q6644992) (← links)