Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems (Q1904710): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Yves Cramer / rank
Normal rank
 
Property / author
 
Property / author: Yves Cramer / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the knapsack polytope / 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: Q3835301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A column generation approach to job grouping for flexible manufacturing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order selection on a single machine with high set-up costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting-plane approach to the edge-weighted maximal clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Parametric Maximum Flow Algorithm and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the supermodular knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean decomposition for integer programming : theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet of regular 0–1 polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: OPTIMAL TOOL MODULE DESIGN PROBLEM FOR NC MACHINE TOOLS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling and solving an FMS part selection problem / 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: Min-cut clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of vertex packing and independence system polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Note on Zero-One Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering, Packing and Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Selection Problem of Shared Fixed Costs and Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulation and Solution of Nonlinear Integer Production Planning Problems for Flexible Manufacturing Systems / 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: Easily Computable Facets of the Knapsack Polytope / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:03, 24 May 2024

scientific article
Language Label Description Also known as
English
Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
scientific article

    Statements

    Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems (English)
    0 references
    0 references
    0 references
    0 references
    7 January 1996
    0 references
    0 references
    valid inequalities
    0 references
    flexible manufacturing system
    0 references
    production planning
    0 references
    dense subhypergraph problem
    0 references
    nonlinear knapsack problem
    0 references
    polyhedral structure
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references