An implementation of exact knapsack separation (Q330511): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Concorde / 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: OR-Library / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / 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.1007/s10898-015-0294-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965789645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two exact algorithms for the capacitated \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch‐and‐price algorithm for the capacitated <i>p</i>‐median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3439711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of exact knapsack separation for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane method for knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Fenchel Cutting Planes for Knapsack Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fenchel Cutting Planes for Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exact separation of mixed integer knapsack cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation algorithms for 0-1 knapsack polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with general cutting planes for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convex-analysis perspective on disjunctive cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimal Algorithm for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact method with variable fixing for solving the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic solution methods for the multilevel generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for the multilevel generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic cuts for multilevel generalized assignment problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new method for solving capacitated location problems based on a set partitioning approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A column generation approach to capacitated \(p\)-median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational evaluation of a general branch-and-price framework for capacitated network location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the capacitated facility location problems with single sourcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank

Latest revision as of 19:58, 12 July 2024

scientific article
Language Label Description Also known as
English
An implementation of exact knapsack separation
scientific article

    Statements

    An implementation of exact knapsack separation (English)
    0 references
    0 references
    0 references
    26 October 2016
    0 references
    knapsack problem
    0 references
    cutting plane
    0 references
    exact separation
    0 references
    generalized assignment problem
    0 references
    multilevel generalized assignment problem
    0 references
    capacitated \(p\)-median problem
    0 references
    capacitated network location problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers