On the public citation graph
Variable metric relaxation methods, part II: The ellipsoid method
0 signed · 41 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-0348-0439-4_9openalex-snapshot
Extremum Problems with Inequalities as Subsidiary Conditions
inferredcites →https://doi.org/10.1007/978-3-642-46629-8_4openalex-snapshot
Polynomial Algorithms for Linear Programming
inferredcites →https://doi.org/10.1007/978-3-642-47404-0openalex-snapshot
Theorie der Konvexen Körper
inferredcites →https://doi.org/10.1007/bf01068854openalex-snapshot
New development trends in nondifferentiable optimization
inferredcites →https://doi.org/10.1007/bf01240785openalex-snapshot
�ber die affine Exzentrizit�t konvexer K�rper
inferredcites →https://doi.org/10.1007/bf01581028openalex-snapshot
On the non-polynomiality of the relaxation method for systems of linear inequalities
inferredcites →https://doi.org/10.1007/bf01581042openalex-snapshot
Convergence of a cyclic ellipsoid algorithm for systems of linear equalities
inferredcites →https://doi.org/10.1007/bf01899996openalex-snapshot
Über das Löwnersche Ellipsoid und sein Analogon unter den einem Eikörper einbeschriebenen Ellipsoiden
inferredcites →https://doi.org/10.1007/bf02341816openalex-snapshot
Utilization of the operation of space dilatation in the minimization of convex functions
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1016/0024-3795(83)80021-4openalex-snapshot
On the relationship between the Hausdorff distance and matrix distances of ellipsoids
inferredcites →https://doi.org/10.1016/0041-5553(80)90061-0openalex-snapshot
Polynomial algorithms in linear programming
inferredcites →https://doi.org/10.1090/s0002-9939-1978-0500555-0openalex-snapshot
A Bound on Solutions of Linear Integer Equalities and Inequalities
inferredcites →https://doi.org/10.1287/moor.5.3.388openalex-snapshot
The Relaxation Method for Solving Systems of Linear Inequalities
inferredcites →https://doi.org/10.1287/moor.7.2.253openalex-snapshot
On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid
inferredcites →https://doi.org/10.1287/moor.8.4.538openalex-snapshot
Integer Programming with a Fixed Number of Variables
inferredcites →https://doi.org/10.1287/opre.29.6.1039openalex-snapshot
Feature Article—The Ellipsoid Method: A Survey
inferredcites →https://doi.org/10.4153/cjm-1954-037-2openalex-snapshot
The Relaxation Method for Linear Inequalities
inferredcites →https://doi.org/10.4153/cjm-1954-038-xopenalex-snapshot
The Relaxation Method for Linear Inequalities
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nav.3800330407openalex-snapshot
The procurement problem: An integer programming problem well suited to a solution using duality
inferred← citeshttps://doi.org/10.1007/11533719_64openalex-snapshot
Server Allocation Algorithms for Tiered Systems
inferred← citeshttps://doi.org/10.1007/978-3-0348-9297-1_6openalex-snapshot
Affine and projective transformations in nondifferentiable optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-11008-0_3openalex-snapshot
Linear Inequalities and Polyhedra
inferred← citeshttps://doi.org/10.1007/978-3-319-11008-0_7openalex-snapshot
Valid Inequalities for Structured Integer Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-11008-0_8openalex-snapshot
Reformulations and Relaxations
inferred← citeshttps://doi.org/10.1007/978-3-642-29952-0_19openalex-snapshot
Polynomial Time Construction of Ellipsoidal Approximations of Zonotopes Given by Generator Descriptions
inferred← citeshttps://doi.org/10.1007/978-94-011-0924-6_8openalex-snapshot
Approximation by Convex Polytopes
inferred← citeshttps://doi.org/10.1007/bf01582060openalex-snapshot
A deep cut ellipsoid algorithm for convex programming: Theory and applications
inferred← citeshttps://doi.org/10.1007/s00453-007-0052-0openalex-snapshot
Server Allocation Algorithms for Tiered Systems
inferred← citeshttps://doi.org/10.1007/s101070100261openalex-snapshot
The many facets of linear programming
inferred← citeshttps://doi.org/10.1016/b978-0-444-89596-7.50023-7openalex-snapshot
Mathematical Programming and Convex Geometry
inferred← citeshttps://doi.org/10.1016/j.ins.2013.04.035openalex-snapshot
On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data
inferred← citeshttps://doi.org/10.1016/j.trb.2018.12.011openalex-snapshot
An algorithm for reliable shortest path problem with travel time correlations
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00337-7openalex-snapshot
Non-standard approaches to integer programming
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12004-0openalex-snapshot
Integer Programming, Lattices, and Results in Fixed Dimension
inferred← citeshttps://doi.org/10.1137/0327039openalex-snapshot
An Ellipsoid Trust Region Bundle Method for Nonsmooth Convex Minimization
inferred← citeshttps://doi.org/10.1287/moor.21.2.307openalex-snapshot
Rounding of Polytopes in the Real Number Model of Computation
inferred← citeshttps://doi.org/10.1287/moor.24.1.193openalex-snapshot
Ellipsoidal Approximations of Convex Sets Based on the Volumetric Barrier
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.