Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: David Pisinger / rank
Normal rank
 
Property / author
 
Property / author: David Pisinger / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2004.09.033 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064370739 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58826447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedily Finding a Dense Subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4867320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete p-dispersion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic and Special Case Algorithms for Dispersion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for maximum dispersion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering and domination in perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Good solutions to discrete noxious location problems via metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roof duality, complementation and persistency in quadratic 0–1 optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of finding dense subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean methods for the 0-1 quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Methods For Solving Quadratic 0–1 Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new upper bound for the 0-1 quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Solution of the Quadratic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete location problems with push-pull objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic knapsack relaxations using cutting planes and semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semidefinite programming approach to the quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming for the \(0-1\) quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for large multiple knapsack problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:48, 24 June 2024

scientific article
Language Label Description Also known as
English
Upper bounds and exact algorithms for \(p\)-dispersion problems
scientific article

    Statements

    Upper bounds and exact algorithms for \(p\)-dispersion problems (English)
    0 references
    30 June 2006
    0 references
    locational analysis
    0 references
    upper bounds
    0 references
    branch-and-bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers