Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality (Q3688105): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivot and Complement–A Heuristic for 0-1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational results with a branch-and-bound algorithm for the general knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Enumeration Algorithm for Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating surrogate constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Based Procedure for Uncapacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological design of centralized computer networks—formulations and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory and Computation of Knapsack Functions / 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: Surrogate Constraint Duality in Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generalized Penalty-Function/Surrogate Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Partitions with Applications to the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction Algorithm for Zero-One Single Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some relationships between lagrangian and surrogate duality in integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4404428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the zero-one knapsack problem and a branch and bound algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The knapsack problem: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-one programming with many variables and few constraints / rank
 
Normal rank

Latest revision as of 17:32, 14 June 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
scientific article

    Statements

    Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality (English)
    0 references
    0 references
    0 references
    1985
    0 references
    multiconstraint 0-1 knapsack problem
    0 references
    multiple resource constraints
    0 references
    solution procedure
    0 references
    relaxations
    0 references
    computational experiments
    0 references
    surrogate bounds
    0 references
    branch and bound
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references