Pages that link to "Item:Q1122493"
From MaRDI portal
The following pages link to A probabilistic heuristic for a computationally difficult set covering problem (Q1122493):
Displaying 50 items.
- A review of recent advances in global optimization (Q842710) (← links)
- Classification of applied methods of combinatorial optimization (Q844352) (← links)
- An effective and simple heuristic for the set covering problem (Q853015) (← links)
- Heuristics for the mirrored traveling tournament problem (Q863992) (← links)
- On the number of local minima for the multidimensional assignment problem (Q867022) (← links)
- Improved modeling and solution methods for the multi-resource routing problem (Q872121) (← links)
- Response time variability (Q880584) (← links)
- A variable neighborhood search algorithm for the multimode set covering problem (Q887195) (← links)
- A constraint programming approach to the additional relay placement problem in wireless sensor networks (Q903915) (← links)
- Logic classification and feature selection for biomedical data (Q929151) (← links)
- Reactive GRASP for the strip-packing problem (Q941532) (← links)
- Design of hybrids for the minimum sum-of-squares clustering problem (Q951921) (← links)
- Solving the response time variability problem by means of a psychoclonal approach (Q972638) (← links)
- A path relinking approach for the team orienteering problem (Q975993) (← links)
- Speeding up continuous GRASP (Q976348) (← links)
- Surrogate constraint normalization for the set covering problem (Q976352) (← links)
- Efficient solutions for special zero-one programming problems (Q995926) (← links)
- Analysis of new variable selection methods for discriminant analysis (Q1010495) (← links)
- Heuristics for the bi-objective path dissimilarity problem (Q1025234) (← links)
- A mathematical program to refine gene regulatory networks (Q1026217) (← links)
- GRASP and path relinking for the max-min diversity problem (Q1038285) (← links)
- Using a greedy random adaptative search procedure to solve the cover printing problem (Q1040963) (← links)
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem (Q1044091) (← links)
- Conditional covering: greedy heuristics and computational results (Q1091265) (← links)
- An interior point algorithm to solve computationally difficult set covering problems (Q1181917) (← links)
- A GRASP for a difficult single machine scheduling problem (Q1184452) (← links)
- Enhancing an algorithm for set covering problems (Q1194745) (← links)
- A Lagrangian-based heuristic for large-scale set covering problems (Q1290617) (← links)
- Heuristics for the flow line problem with setup costs (Q1303708) (← links)
- Algorithms for large scale set covering problems (Q1309874) (← links)
- Clustering heuristics for set covering (Q1309879) (← links)
- A heuristic algorithm for the multi-criteria set-covering problems (Q1312032) (← links)
- An exact algorithm for the maximum stable set problem (Q1328431) (← links)
- The design of a 0-1 integer optimizer and its application in the Carmen system (Q1390346) (← links)
- Optimization of real-time multiserver system with two different channels and shortage of maintenance facilities. (Q1418590) (← links)
- GRASP for set packing problems. (Q1420382) (← links)
- Real-time multiserver and multichannel systems with shortage of maintenance crews. (Q1596982) (← links)
- A parallel genetic algorithm to solve the set-covering problem (Q1603319) (← links)
- Real-time system with homogeneous servers and nonidentical channels in steady-state (Q1603341) (← links)
- Detecting robust cliques in graphs subject to uncertain edge failures (Q1640046) (← links)
- Intelligent-guided adaptive search for the maximum covering location problem (Q1652063) (← links)
- GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem (Q1652080) (← links)
- A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints (Q1652104) (← links)
- Carousel greedy: a generalized greedy algorithm with applications in optimization (Q1652355) (← links)
- A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands (Q1654357) (← links)
- Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem (Q1701982) (← links)
- GRASP and VNS for solving the \(p\)-next center problem (Q1725619) (← links)
- Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles (Q1752844) (← links)
- Extended GRASP for the job shop scheduling problem with total weighted tardiness objective (Q1753631) (← links)
- Scatter search for the cutwidth minimization problem (Q1761768) (← links)
