Pages that link to "Item:Q4950819"

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

Displaying 50 items.

• An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859) (← links)
• A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering (Q336718) (← links)
• Tactical fixed job scheduling with spread-time constraints (Q337014) (← links)
• A hybrid heuristic for the set covering problem (Q373244) (← links)
• An exact approach for the vertex coloring problem (Q429677) (← links)
• Ad hoc heuristic for the cover printing problem (Q435726) (← links)
• Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems (Q439646) (← links)
• Exact weighted vertex coloring via branch-and-price (Q448972) (← links)
• An algorithm for approximating the Pareto set of the multiobjective set covering problem (Q513581) (← links)
• Experiments with LAGRASP heuristic for set \(k\)-covering (Q691433) (← links)
• A meta-heuristic with orthogonal experiment for the set covering problem (Q702766) (← links)
• The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory (Q779535) (← links)
• Exploring further advantages in an alternative formulation for the set covering problem (Q783157) (← links)
• Locating stops along bus or railway lines -- a bicriteria problem (Q816419) (← links)
• An effective and simple heuristic for the set covering problem (Q853015) (← links)
• Generating, scheduling and rostering of shift crew-duties: applications at the Hong Kong international airport (Q857315) (← links)
• Solution techniques for the large set covering problem (Q868387) (← links)
• A column generation approach for the rail crew re-scheduling problem (Q869160) (← links)
• A GRASP algorithm to solve the unicost set covering problem (Q878597) (← links)
• Spectral projected subgradient with a momentum term for the Lagrangean dual approach (Q878598) (← links)
• Cyclic preference scheduling of nurses using a Lagrangian-based heuristic (Q880573) (← links)
• Optimizing word set coverage for multi-event summarization (Q887893) (← links)
• Real-time vehicle rerouting problems with time windows (Q958553) (← links)
• Surrogate constraint normalization for the set covering problem (Q976352) (← links)
• An electromagnetism metaheuristic for the unicost set covering problem (Q976443) (← links)
• Computational experience with general cutting planes for the set covering problem (Q1002077) (← links)
• A Lagrangian relaxation approach for the multiple sequence alignment problem (Q1016042) (← links)
• Heuristics for the variable sized bin-packing problem (Q1017465) (← links)
• Models and heuristic algorithms for a weighted vertex coloring problem (Q1038841) (← links)
• The train driver recovery problem-a set partitioning based model and solution method (Q1046697) (← links)
• Pick-and-choose heuristics for partial set covering (Q1122585) (← links)
• Simple Lagrangian heuristic for the set covering problem (Q1278602) (← links)
• A Lagrangian-based heuristic for large-scale set covering problems (Q1290617) (← links)
• Algorithms for large scale set covering problems (Q1309874) (← links)
• The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems (Q1333026) (← links)
• A surrogate heuristic for set covering problems (Q1342046) (← 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)
• A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles (Q1582189) (← links)
• The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation (Q1630276) (← links)
• A distance-limited continuous location-allocation problem for spatial planning of decentralized systems (Q1651515) (← links)
• Relaxation heuristics for the set multicover problem with generalized upper bound constraints (Q1652583) (← links)
• Modified spectral projected subgradient method: convergence analysis and momentum parameter heuristics (Q1653958) (← links)
• Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (Q1695015) (← links)
• Thinning out Steiner trees: a node-based model for uniform edge costs (Q1699615) (← links)
• Synthetic optimization model and algorithm for railway freight center station location and wagon flow organization problem (Q1717930) (← links)
• A tolerance function for the multiobjective set covering problem (Q1733317) (← links)
• Natalie 2.0: sparse global network alignment as a special case of quadratic assignment (Q1736730) (← links)
• A computational study of a nonlinear minsum facility location problem (Q1761206) (← links)