A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization (Q1897348): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refined proximity and sensitivity results in linearly constrained convex separable integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalization of Barahona's algorithm for cases of integer non-linear programming with box constraints / 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: Modular Constructions for Combinatorial Geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some proximity and sensitivity results in quadratic integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polynomial solvability of the high multiplicity total weighted tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unimodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for an integer quadratic non-separable transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex separable optimization is not much harder than linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree-two Inequalities, Clique Facets, and Biperfect Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4064159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Applications of Minimum Cuts in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph-Theoretic Equivalence for Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cuts and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:56, 23 May 2024

scientific article
Language Label Description Also known as
English
A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization
scientific article

    Statements

    A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization (English)
    0 references
    0 references
    23 June 1996
    0 references
    0 references
    0 references
    0 references
    0 references
    NP-hardness
    0 references
    polynomially solvable integer quadratic optimization
    0 references