The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5608997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear 0–1 programming: I. Linearization techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The perfectly matchable subgraph polytope of a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5635469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes—On a Selection Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solvable case of quadratic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the Bipartite Subgraph Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in quadratic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polytope des independants d'un graphe série-parallèle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of Totally Unimodular Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equipartition polytope. II: Valid inequalities and facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3270229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: L’algebre de Boole et ses applications en recherche operationnelle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3935744 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the clique partitioning polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Network Flow Problems Solved with Pseudo-Boolean Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of pseudo-Boolean programming to the theory of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roof duality, complementation and persistency in quadratic 0–1 optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of Nonlinear 0-1 Programming / 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: Q3050157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stable set polytope of a series-parallel graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing 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: Almost integral polyhedra related to certain combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4182528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering, Packing and Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total unimodularity and the Euler-subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The travelling salesman problem and a class of polyhedra of diameter two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of a 532-city symmetric traveling salesman problem by branch and cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cuts and related problems / 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: A class of facet producing graphs for vertex packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5611528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further facet generating procedures for vertex packing polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting the facets of zero–one polytopes / rank
 
Normal rank

Revision as of 08:23, 20 June 2024

scientific article
Language Label Description Also known as
English
The Boolean quadratic polytope: Some characteristics, facets and relatives
scientific article

    Statements

    The Boolean quadratic polytope: Some characteristics, facets and relatives (English)
    0 references
    1989
    0 references
    polyhedral combinatorics
    0 references
    series-parallel graphs
    0 references
    polynomial solvability
    0 references
    unconstrained quadratic zero-one programming
    0 references
    Boolean quadric polytope
    0 references
    facet-defining inequalities
    0 references
    facets
    0 references
    sparse quadratic forms
    0 references
    vertex- packing polytope
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references