Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (Q537960): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-010-9554-4 / rank
Normal rank
 
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/s10898-010-9554-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1985624218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Equality Constrained Integer Knapsacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-standard approaches to integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cuts for Conic Mixed-Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Practical Volumetric Cutting Plane Method for Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ellipsoidal Approximations of Convex Sets Based on the Volumetric Barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lovász' lattice reduction and the nearest lattice point problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New volume ratio properties for convex symmetric bodies in \({\mathbb{R}}^ n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3876608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5611106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved strategies for branching on general disjunctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching on general disjunctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding of Polytopes in the Real Number Model of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of approximating the maximal inscribed ellipsoid for a polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column basis reduction and decomposable knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3745276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generalized Basis Reduction Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3632455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Selecting Disjunctions in Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Segment LLL reduction of lattice bases using modular arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding an interior point in the optimal face of linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4347849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4347852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in semidefinite and interior-point methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical View of Interior-Point Methods in Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4204004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for minimizing convex functions over convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the finite convergence of interior-point algorithms for linear programming / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-010-9554-4 / rank
 
Normal rank

Latest revision as of 20:51, 9 December 2024

scientific article
Language Label Description Also known as
English
Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
scientific article

    Statements

    Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (English)
    0 references
    0 references
    0 references
    23 May 2011
    0 references
    linear programming
    0 references
    volumetric center
    0 references
    analytic center
    0 references
    interior point methods
    0 references
    convex programming
    0 references
    mixed integer programming
    0 references
    lattice basis reduction
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers