A new approach for modeling and solving set packing problems (Q2462145): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2006.12.068 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2082885489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the maximum edge weight clique problem via unconstrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing for the unconstrained quadratic pseudo-Boolean function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of a quadratic pseudo-Boolean function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-Boolean optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP for set packing problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Memory Tabu Search for Binary Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-pass heuristics for large-scale unconstrained binary quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for a bidding problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of Nonlinear 0-1 Programming / 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: Using the unconstrained quadratic program to model and solve Max 2-SAT problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An unconstrained quadratic binary programming approach to the vertex coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using \(xQx\) to model and solve the uncapacitated task allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An evolutionary heuristic for quadratic 0-1 programming / 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: A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Auction Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization in forestry / rank
 
Normal rank
Property / cites work
 
Property / cites work: CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247444 / rank
 
Normal rank

Latest revision as of 13:26, 27 June 2024

scientific article
Language Label Description Also known as
English
A new approach for modeling and solving set packing problems
scientific article

    Statements

    A new approach for modeling and solving set packing problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 November 2007
    0 references
    0 references
    integer programming
    0 references
    combinatorial auctions
    0 references
    metaheuristics
    0 references
    set packing problem
    0 references
    unconstrained quadratic binary program
    0 references
    0 references