The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments (Q2445845): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disopt.2013.03.001 / rank
Normal rank
 
Property / author
 
Property / author: José Rui Figueira / rank
Normal rank
 
Property / author
 
Property / author: José Rui Figueira / 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.disopt.2013.03.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003303695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse combinatorial optimization: a survey on problems, methods, and results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an instance of the inverse shortest paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Inverse Spanning Tree Problems Through Network Flow Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Applications in Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting plane algorithms for the inverse mixed integer linear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two general methods for inverse optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general model of some inverse combinatorial optimization problems and its solution method under \(\ell_\infty\) norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mixed Integer Linear Bilevel Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial algorithms for inverse network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal algorithm for the multiple-choice knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Analysis of Computational Tests of Algorithms and Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimal Algorithm for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISOPT.2013.03.001 / rank
 
Normal rank

Latest revision as of 16:37, 18 December 2024

scientific article
Language Label Description Also known as
English
The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments
scientific article

    Statements

    The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments (English)
    0 references
    0 references
    0 references
    0 references
    15 April 2014
    0 references
    inverse optimization
    0 references
    knapsack problem
    0 references

    Identifiers