Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems (Q2355937): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.ejor.2013.04.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2098002863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate constraint normalization for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithm for the general multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete-Variable Extremum Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multidimensional 0-1 knapsack problem -- bounds and computational aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategic oscillation for the quadratic multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Constraints in Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flows in Arborescences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Constraint Duality in Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Thresholding: Improved Search by Nonmonotonic Trajectories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tutorial on surrogate constraint approaches for optimization in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least-cost network topology design for a new service: An application of tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting nested inequalities and surrogate constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved convergent heuristics for the 0-1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu thresholding algorithm for arc crossing minimization in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved results on the 0--1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4826164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic tabu search strategies for the traveling purchaser problem / rank
 
Normal rank

Latest revision as of 13:28, 10 July 2024

scientific article
Language Label Description Also known as
English
Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
scientific article

    Statements

    Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems (English)
    0 references
    0 references
    28 July 2015
    0 references
    metaheuristics
    0 references
    greedy algorithms
    0 references
    knapsack/covering problems
    0 references
    surrogate constraints
    0 references
    multi-start/strategic oscillation
    0 references
    tabu search
    0 references
    0 references
    0 references
    0 references

    Identifiers