GRASP for set packing problems.

DOI10.1016/S0377-2217(03)00263-7zbMath1099.90572OpenAlexW2053321548MaRDI QIDQ1420382

Xavier Gandibleux, Xavier Delorme, Joaquin Rodriguez

Publication date: 2 February 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00263-7

zbMATH Keywords

GRASPCombinatorial optimizationSet packing problemPath relinkingMetaheuristicRailway planning problemReactive

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

Solving the set packing problem via a maximum weighted independent set heuristic, Stability evaluation of a railway timetable at station level, Heuristic algorithms for visiting the customers in a rolling schedule environment, A multi-objective model for environmental investment decision making, Packing items to feed assembly lines, A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems, Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem, An evolutionary algorithm based hyper-heuristic framework for the set packing problem, Railway track allocation: Models and methods, Applications of the DM‐GRASP heuristic: a survey, Reactive GRASP for the strip-packing problem, A new approach for modeling and solving set packing problems, Balancing and scheduling tasks in assembly lines with sequence-dependent setup times, Path relinking for unconstrained binary quadratic programming, Multi-neighborhood tabu search for the maximum weight clique problem, Hybridization of GRASP metaheuristic with data mining techniques, A fast approximation algorithm for solving the complete set packing problem, Non-linear anonymous pricing combinatorial auctions, A hybrid evolutionary approach for set packing problem

Uses Software

• GRASP
• CPLEX
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• BOTH 2001 -- Böhm's theorem: applications to computer science theory. Proceedings of one of the four satellite workshops of the 28th international colloquium on automata, languages and programming (ICALP 2001) held in Crete, Greece, July 13, 2001
• A probabilistic heuristic for a computationally difficult set covering problem
• A method for the cutting stock problem with different qualities
• Greedy randomized adaptive search procedures
• Metaheuristics: A bibliography
• An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• Routing Trains Through Railway Stations: Model Formulation and Algorithms
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• A GRASP with path-relinking for private virtual circuit routing
• On the facial structure of set packing polyhedra
• A set packing model for the ground holding problem in congested networks