GRASP for set packing problems.

DOI10.1016/S0377-2217(03)00263-7MaRDI QIDQ1420382zbMATH OpenOpenAlexFDO

Authors Xavier Delorme, Xavier Gandibleux, 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

Combinatorial optimizationGRASPMetaheuristicPath relinkingRailway planning problemReactiveSet packing problem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2050708
• Greedy randomized adaptive search procedures
• Reactive GRASP for the strip-packing problem
• An annotated bibliography of GRASP – Part I: Algorithms
• GRASP: An annoted bibliography

Cites work

• A GRASP with path-relinking for private virtual circuit routing
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• A method for the cutting stock problem with different qualities
• A probabilistic heuristic for a computationally difficult set covering problem
• A set packing model for the ground holding problem in congested networks
• An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
• 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
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• GRASP: An annoted bibliography
• Greedy randomized adaptive search procedures
• Handbook of applied optimization
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• scientific article; zbMATH DE number 2050708 (Why is no real title available?)
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Metaheuristics: A bibliography
• On the facial structure of set packing polyhedra
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• Routing Trains Through Railway Stations: Model Formulation and Algorithms

Cited in

(19)

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

Describes a project that uses

Uses Software

• GRASP
• CPLEX
• Tabu search

This page was built for publication: GRASP for set packing problems.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1420382)