26 search results - page 2 / 6 » Heuristics for a Brokering Set Packing Problem |
ICTAI
2005
IEEE
13 years 11 months ago
2005
IEEE
In this paper, a combinatorial auction problem is modeled as a NP-complete set packing problem and a Lagrangian relaxation based heuristic algorithm is proposed. Extensive experim...
EOR
2002
13 years 5 months ago
2002
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems the...
CEC
2007
IEEE
13 years 11 months ago
2007
IEEE
— Good algorithms exist for solving the strip packing problem when the objective is to minimise the amount of wasted material. We describe a multi-objective evolutionary algorith...
HEURISTICS
2002
13 years 5 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
DM
2008
13 years 5 months ago
2008
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...