On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs (Q3675916): 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: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facial disjunctive programs and sequences of cutting-planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—On the Generalized Lattice Point Problem and Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations on a cutting plane method for solving concave minimization problems with linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity Cuts and Cut Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generalized Lattice-Point Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cutting-Plane Game for Facial Disjunctive Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Group Problem and a Subadditive Approach to Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme Point Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-concave minimization subject to linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4082544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization with disjunctive constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generation of deep disjunctive cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finitely convergent procedure for facial disjunctive programs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:28, 14 June 2024

scientific article
Language Label Description Also known as
English
On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
scientific article

    Statements

    On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs (English)
    0 references
    0 references
    0 references
    0 references
    1985
    0 references
    0 references
    0 references
    0 references
    0 references
    convergence of cutting plane algorithms
    0 references
    nonconvex programs
    0 references
    Generalized Lattice Point Problems
    0 references