Pages that link to "Item:Q4950819"
From MaRDI portal
The following pages link to A Heuristic Method for the Set Covering Problem (Q4950819):
Displayed 35 items.
- An exact approach for the vertex coloring problem (Q429677) (← 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)
- 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)
- 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)
- 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)
- On some difficult linear programs coming from set partitioning (Q1348247) (← links)
- Algorithms for railway crew management (Q1365052) (← links)
- A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles (Q1582189) (← links)
- A SAT approach to query optimization in mediator systems (Q1777403) (← links)
- An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport (Q1959179) (← links)
- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems (Q2267294) (← 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)
- 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)
- THE CONTINUOUS STOP LOCATION PROBLEM IN PUBLIC TRANSPORTATION NETWORKS (Q3632030) (← links)