The precedence constrained knapsack problem: separating maximally violated inequalities (Q494425): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Daniel G. Espinoza / rank
Normal rank
 
Property / author
 
Property / author: Daniel G. Espinoza / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / 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.dam.2015.05.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2137984373 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57707457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical Cuts on the Unit Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving LP Relaxations of Large-Scale Precedence Constrained Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strengthened formulation and cutting planes for the open pit mine production scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-based facets for the precedence constrained knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral results for the precedence-constrained knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for the Open-Pit Mine Production Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-Machine Scheduling with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sliding time window heuristic for open pit mine block sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting, tilting and fractional programming revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: (1,k)-configurations and facets for packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting cover inequalities for the precedence-constrained knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting valid inequalities for the precedence constrained knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faces for a linear inequality in 0–1 variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Facets and Strong Valid Inequalities for Integer Programs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:39, 10 July 2024

scientific article
Language Label Description Also known as
English
The precedence constrained knapsack problem: separating maximally violated inequalities
scientific article

    Statements

    The precedence constrained knapsack problem: separating maximally violated inequalities (English)
    0 references
    0 references
    0 references
    0 references
    1 September 2015
    0 references
    lifting
    0 references
    shrinking
    0 references
    precedence-constrained knapsack problem
    0 references
    induced cover inequality
    0 references
    induced clique inequality
    0 references
    separation problem
    0 references

    Identifiers