Pages that link to "Item:Q4950819"

The following pages link to A Heuristic Method for the Set Covering Problem (Q4950819):

Displaying 50 items.

• An aggregation heuristic for large scale p-median problem (Q1762151) (← links)
• A relax-and-cut framework for Gomory mixed-integer cuts (Q1762453) (← links)
• A SAT approach to query optimization in mediator systems (Q1777403) (← links)
• An algorithm for set covering problem (Q1823139) (← links)
• Some heuristic methods for solving \(p\)-median problems with a coverage constraint (Q1926741) (← links)
• Solving a multi-objective interval crew-scheduling problem via genetic algorithms (Q1929495) (← links)
• An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport (Q1959179) (← links)
• A procedure for solution of the problem of optimal covering of a finite set (Q1968506) (← links)
• A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem (Q1991205) (← links)
• Efficient feature selection for logical analysis of large-scale multi-class datasets (Q2045033) (← links)
• An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem (Q2099500) (← links)
• Column generation extensions of set covering greedy heuristics (Q2102849) (← links)
• Robust min-max regret covering problems (Q2162527) (← links)
• A theoretical justification of the set covering greedy heuristic of Caprara et al. (Q2172080) (← links)
• Adaptive feasible and infeasible tabu search for weighted vertex coloring (Q2200563) (← links)
• A two-phase heuristic for set covering (Q2204628) (← links)
• Deadlock analysis and control using Petri net decomposition techniques (Q2212081) (← links)
• An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
• A graph partitioning strategy for solving large-scale crew scheduling problems (Q2260895) (← links)
• Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems (Q2267294) (← links)
• Railway crew scheduling: models, methods and applications (Q2286960) (← links)
• Solving the non-unicost set covering problem by using cuckoo search and black hole optimization (Q2311311) (← links)
• A set covering approach for multi-depot train driver scheduling (Q2343986) (← links)
• Convergence analysis for the modified spectral projected subgradient method (Q2355316) (← links)
• New heuristics for the conditional covering problem (Q2365766) (← links)
• Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem (Q2379863) (← links)
• Set covering with almost consecutive ones property (Q2386204) (← links)
• A relax-and-cut algorithm for the set partitioning problem (Q2462542) (← links)
• Constrained 0-1 quadratic programming: basic approaches and extensions (Q2467302) (← links)
• A LAD-based method for selecting short oligo probes for genotyping applications (Q2481571) (← 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)
• Column generation based heuristic for tactical planning in multi-period vehicle routing (Q2643933) (← links)
• An efficient and practically robust hybrid metaheuristic algorithm for solving fuzzy bus terminal location problems (Q2911573) (← links)
• A survey on vertex coloring problems (Q3002686) (← links)
• A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation (Q3057155) (← 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)
• (Q3487139) (← links)
• THE CONTINUOUS STOP LOCATION PROBLEM IN PUBLIC TRANSPORTATION NETWORKS (Q3632030) (← links)
• Two methods of ordering the covering elements for the solution of the set covering problem (Q4007333) (← links)
• (Q4735035) (← links)
• Note: A local-search heuristic for large set-covering problems (Q4859572) (← 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)
• The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic (Q5357751) (← links)
• RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (Q5385039) (← links)
• A scheme for determining vehicle routes based on Arc-based service network design (Q5881488) (← links)
• Approximating the Pareto frontier for a challenging real-world bi-objective covering problem (Q5883604) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)