New approaches for optimizing over the semimetric polytope (Q2576727): Difference between revisions

From MaRDI portal
Changed an 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-005-0620-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086003967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The volume algorithm revisited: relation with bundle methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The volume algorithm: Producing primal solutions with a subgradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-Boolean optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On improvements to the analytic center cutting plane method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving semidefinite quadratic problems within nonsmooth optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Bundle Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: About Lagrangian methods in integer optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient cuts in Lagrangean `relax-and-cut' schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean relaxation. (With comments and rejoinder). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4668573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial approaches to multiflow problems / rank
 
Normal rank

Latest revision as of 13:12, 11 June 2024

scientific article
Language Label Description Also known as
English
New approaches for optimizing over the semimetric polytope
scientific article

    Statements

    New approaches for optimizing over the semimetric polytope (English)
    0 references
    0 references
    0 references
    0 references
    14 December 2005
    0 references
    semimetric polytope
    0 references
    Lagrangian methods
    0 references
    max-cut
    0 references
    network design
    0 references

    Identifiers