A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MOTGA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / 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.ejor.2011.11.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069994399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP relaxation of the two dimensional knapsack problem with box and GUB constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining test problems via Internet / rank
 
Normal rank
Property / cites work
 
Property / cites work: On separating cover inequalities for the multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Penalty-Function Concepts in Mathematical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-level search strategy for the 0-1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the 0-1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $0 (n^3)$ worst case bounded special $LP$ knapsack $(0-1)$ with two constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for knapsack problems with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On The Strength Of Relaxations Of Multidimensional Knapsack Problems / 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: The Lagrangian Relaxation Method for Solving Integer Programming 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: an overview. / 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: An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / 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 Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of Lagrange Multipliers in Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient tabu search approach for the 0-1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scatter search for the 0-1 multidimensional knapsack problem / 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: Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem / 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: Q4400850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new ant colony optimization algorithm for the multidimensional Knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic algorithm for the multidimensional zero-one knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4265265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / 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: A heuristic solution procedure for the multiconstraint zero-one knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Algorithms for the 0/1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Lagrangean Techniques for Discrete Optimization / 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: Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem / 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: Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New convergent heuristics for 0-1 mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4054818 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:15, 5 July 2024

scientific article
Language Label Description Also known as
English
A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
scientific article

    Statements

    A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    16 August 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    integer programming
    0 references
    \(0\)-\(1\) multidimensional knapsack problem
    0 references
    Lagrangian method
    0 references
    Lagrangian capacity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references