Polyhedral annexation in mixed integer and combinatorial programming (Q4139972): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Intersection Cuts—A New Type of Cutting Planes for Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming and convex analysis: Intersection cuts from outer polars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive programming: Properties of the convex hull of feasible points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerative Cuts: I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polaroids: A new tool in non‐convex and in integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex and polaroid extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree-search algorithm for mixed integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity Cuts and Cut Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity cuts for multiple choice problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral convexity cuts and negative edge extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generalized Lattice-Point Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Disjunctive-Facet Problem: Formulation and Solution Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities for mixed integer programs with structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3274590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some polyhedra related to combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some continuous functions related to corner polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trivial integer programs unsolvable by branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting-planes for programs with disjunctive constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypercylindrically Deduced Cuts in Zero-One Integer Programs / rank
 
Normal rank

Revision as of 21:10, 12 June 2024

scientific article; zbMATH DE number 3568359
Language Label Description Also known as
English
Polyhedral annexation in mixed integer and combinatorial programming
scientific article; zbMATH DE number 3568359

    Statements

    Polyhedral annexation in mixed integer and combinatorial programming (English)
    0 references
    0 references
    1975
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references