Pages that link to "Item:Q1122493"

The following pages link to A probabilistic heuristic for a computationally difficult set covering problem (Q1122493):

Displaying 50 items.

• Improved solutions to the Steiner triple covering problem (Q293185) (← links)
• Exact and heuristic algorithms for the design of hub networks with multiple lines (Q319742) (← links)
• An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859) (← links)
• Integer programming models for feature selection: new extensions and a randomized solution algorithm (Q322475) (← links)
• Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks (Q322774) (← links)
• Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem (Q322911) (← links)
• Heuristics for the generalized median graph problem (Q323345) (← links)
• Minimising maximum response time (Q336510) (← links)
• A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem (Q336528) (← links)
• A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems (Q336709) (← links)
• A GRASP metaheuristic for microarray data analysis (Q336713) (← links)
• A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering (Q336718) (← links)
• A hybrid column generation with GRASP and path relinking for the network load balancing problem (Q336721) (← links)
• A hybrid data mining GRASP with path-relinking (Q336726) (← links)
• A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem (Q336733) (← links)
• GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem (Q336883) (← links)
• A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading (Q337617) (← links)
• Vector bin packing with heterogeneous bins: application to the machine reassignment problem (Q338869) (← links)
• Branch and bound for the cutwidth minimization problem (Q339558) (← links)
• A nonmonotone GRASP (Q340011) (← links)
• The constrained shortest path tour problem (Q342457) (← links)
• The dynamic vehicle allocation problem with application in trucking companies in Brazil (Q342558) (← links)
• Multi-depot vessel routing problem in a direction dependent wavefield (Q405664) (← links)
• Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking (Q421715) (← links)
• Exact and heuristic solutions to minimize total waiting time in the blood products distribution problem (Q447561) (← links)
• A hybrid soft computing approach for subset problems (Q474017) (← links)
• A GRASP heuristic for slab scheduling at continuous casters (Q480761) (← links)
• A survey on optimization metaheuristics (Q497180) (← links)
• A discrete gravitational search algorithm for solving combinatorial optimization problems (Q498096) (← links)
• Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs (Q521579) (← links)
• Scatter search for the bandpass problem (Q524910) (← links)
• A class of polynomially solvable 0-1 programming problems and an application (Q547367) (← links)
• Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem (Q548680) (← links)
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing (Q610979) (← links)
• A guided reactive GRASP for the capacitated multi-source Weber problem (Q622155) (← links)
• Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP (Q689251) (← links)
• Restart strategies for GRASP with path-relinking heuristics (Q691439) (← links)
• A biased random-key genetic algorithm for the Steiner triple covering problem (Q691474) (← links)
• Greedy random adaptive memory programming search for the capacitated clustering problem (Q707129) (← links)
• Continuous GRASP with a local active-set method for bound-constrained global optimization (Q708907) (← links)
• A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution (Q763242) (← links)
• GRASP with path-relinking for the generalized quadratic assignment problem (Q763245) (← links)
• Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems (Q764792) (← links)
• Exploring further advantages in an alternative formulation for the set covering problem (Q783157) (← links)
• Metaheuristics in combinatorial optimization (Q817206) (← links)
• The food bank resource allocation problem (Q828769) (← links)
• Metaheuristics for the distance constrained generalized covering traveling salesman problem (Q832809) (← links)
• A GRASP approach for the extended car sequencing problem (Q835577) (← links)
• A combinatorial algorithm for the TDMA message scheduling problem (Q839680) (← links)
• A review of recent advances in global optimization (Q842710) (← links)