A fast approximation algorithm for solving the complete set packing problem (Q2514810): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2145668313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach for modeling and solving set packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial case of unconstrained zero-one quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing an algorithm for set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New facets for the set packing polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP for set packing problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of the Core of Combinatorial Optimization Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Auctions: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Set Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified modeling and solution framework for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Power Indices for Large Voting Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new modeling and solution approach for the set-partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anytime coalition structure generation in multi-agent systems with positive or negative externalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally Manageable Combinational Auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm for optimal winner determination in combinatorial auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coalition structure generation with worst case guarantees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing trains through a railway station based on a node packing model / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:11, 9 July 2024

scientific article
Language Label Description Also known as
English
A fast approximation algorithm for solving the complete set packing problem
scientific article

    Statements

    A fast approximation algorithm for solving the complete set packing problem (English)
    0 references
    0 references
    4 February 2015
    0 references
    set packing problem
    0 references
    combinatorial auctions
    0 references
    winner determination problem
    0 references
    coalition structure generation
    0 references
    large-scale MILP
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references