Keyword: polyhedra

Found 27 papers in total
Semicontinuity Results on Parametric Vector Variational Inequalities with Polyhedral Constraint Sets
Semicontinuity Results on Parametric Vector Variational Inequalities with Polyhedral Constraint Sets
2013,
New results on the lower semicontinuity and upper semicontinuity properties of the...
Maximal perimeter, diameter and area of equilateral unit‐width convex polygons
Maximal perimeter, diameter and area of equilateral unit‐width convex polygons
2013,
The paper answers the three distinct questions of maximizing the perimeter, diameter...
Finding largest small polygons with GloptiPoly
Finding largest small polygons with GloptiPoly
2013,
A small polygon is a convex polygon of unit diameter. We are interested in small...
On discrete optimization with ordering
On discrete optimization with ordering
2013,
This paper studies discrete optimization problems with ordering requirements. These...
The split closure of a strictly convex body
The split closure of a strictly convex body
2011,
The Chvátal–Gomory closure and the split closure of a rational polyhedron...
Master corner polyhedron: Vertices
Master corner polyhedron: Vertices
2013,
We focus on the vertices of the master corner polyhedron (MCP), a fundamental object...
Lipschitzian stability of parametric variational inequalities over perturbed polyhedral convex sets
Lipschitzian stability of parametric variational inequalities over perturbed polyhedral convex sets
2012,
In this paper we investigate the Lipschitz‐like property of the solution...
Extending Steinitz’s Theorem to Upward Star‐Shaped Polyhedra and Spherical Polyhedra
Extending Steinitz’s Theorem to Upward Star‐Shaped Polyhedra and Spherical Polyhedra
2011,
In 1922, Steinitz’s theorem gave a complete characterization of the topological...
Orbitopal fixing
Orbitopal fixing
2011,
The topic of this paper are integer programming models in which a subset of...
The Chvátal‐Gomory Closure of a Strictly Convex Body
The Chvátal‐Gomory Closure of a Strictly Convex Body
2011,
In this paper, we prove that the Chvátal‐Gomory closure of a set...
On mixed‐integer sets with two integer variables
On mixed‐integer sets with two integer variables
2011,
We study polyhedral mixed‐integer sets with two integer variables. We show that...
Valid inequalities and branch‐and‐cut for the clique pricing problem
Valid inequalities and branch‐and‐cut for the clique pricing problem
2011,
Motivated by an application in highway pricing, we consider the problem that consists...
On the complexity of submodular function minimisation on diamonds
On the complexity of submodular function minimisation on diamonds
2011,
Let ( L ; ⊓ , ⊔ ) be a finite lattice and let n be a...
Generalized equitable preference in multiobjective programming
Generalized equitable preference in multiobjective programming
2011,
The concept of equitability in multiobjective programming is generalized within a...
A note on the MIR closure and basic relaxations of polyhedra
A note on the MIR closure and basic relaxations of polyhedra
2011,
Anderson et al. (2005) show that for a polyhedral mixed integer set defined by a...
The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations
The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations
2011,
We consider the network loading problem (NLP) under a polyhedral uncertainty...
Diameter of Polyhedra: Limits of Abstraction
Diameter of Polyhedra: Limits of Abstraction
2010,
We investigate the diameter of a natural abstraction of the 1-skeleton of polyhedra....
Integral decomposition of polyhedra and some applications in mixed integer programming
Integral decomposition of polyhedra and some applications in mixed integer programming
2003,
This paper addresses the question of decomposing an infinite family of rational...
A note on Faigle and Kern's dual greedy polyhedra
A note on Faigle and Kern's dual greedy polyhedra
2000,
U. Faigle and W. Kern have recently extended the work of their earlier paper and of M....
Strong inequalities for capacitated survivable network design problems
Strong inequalities for capacitated survivable network design problems
2000,
We present several classes of facet-defining inequalities to strengthen polyhedra...
Projection with a minimal system of inequalities
Projection with a minimal system of inequalities
1998,
Projection of a polyhedron involves the use of a cone whose extreme rays induce the...
On the monotonization of polyhedra
On the monotonization of polyhedra
1997,
In polyhedral combinatorics one often has to analyze the facial structure of less than...
The permutahedron of N-sparse posets
The permutahedron of N-sparse posets
1996,
The permutahedron of a poset is the convex hull of all incidence vectors of linear...
The canonical order and optimization problems
The canonical order and optimization problems
1996,
Using the partial order technique, the authors describe a subclass of objective...
Papers per page: