Pages that link to "Item:Q5385039"

The following pages link to RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (Q5385039):

Displaying 38 items.

• An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859) (← links)
• The robust set covering problem with interval data (Q367647) (← links)
• A hybrid heuristic for the set covering problem (Q373244) (← links)
• Exact and heuristic approaches for the set cover with pairs problem (Q691479) (← links)
• A meta-heuristic with orthogonal experiment for the set covering problem (Q702766) (← 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)
• Optimizing word set coverage for multi-event summarization (Q887893) (← links)
• An electromagnetism metaheuristic for the unicost set covering problem (Q976443) (← links)
• Solving large set covering problems on a personal computer (Q1097839) (← links)
• Pick-and-choose heuristics for partial set covering (Q1122585) (← links)
• Simple Lagrangian heuristic for the set covering problem (Q1278602) (← links)
• A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems (Q1290170) (← links)
• Algorithms for large scale set covering problems (Q1309874) (← links)
• Pareto optimality and a class of set covering heuristics (Q1309875) (← links)
• A surrogate heuristic for set covering problems (Q1342046) (← links)
• Graph theoretic relaxations of set covering and set partitioning problems (Q1390264) (← links)
• Hybrid heuristic algorithms for set covering. (Q1406642) (← links)
• Network based heuristics for the set covering problem (Q1580446) (← links)
• Relaxation heuristics for the set multicover problem with generalized upper bound constraints (Q1652583) (← links)
• Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (Q1695015) (← links)
• A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem (Q1991205) (← links)
• Design of a heuristic algorithm for the generalized multi-objective set covering problem (Q2149956) (← links)
• A two-phase heuristic for set covering (Q2204628) (← links)
• A new approach for solving set covering problem using jumping particle swarm optimization method (Q2311260) (← links)
• Optimization of the number and arrangement of circles of two radii for forming a \(k\)-covering of a bounded set (Q2332657) (← links)
• A set covering approach for multi-depot train driver scheduling (Q2343986) (← 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)
• Innovative cost allocation strategies for the shortest route relaxation of the set covering problem (Q2907709) (← links)
• Effective heuristics for the Set Covering with Pairs Problem (Q3002555) (← links)
• A Nested Decomposition Approach for a Large Scale Set Covering Problem: A Model with a Variety of Applications in Industry 4.0 (Q3299233) (← links)
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics (Q3487135) (← links)
• (Q3487139) (← links)
• A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem (Q4656683) (← links)
• (Q4735035) (← links)
• On the Number and Arrangement of Sensors for the Multiple Covering of Bounded Plane Domains (Q4973240) (← links)
• A set covering based matheuristic for a real‐world city logistics problem (Q5246831) (← links)