Results 21 to 30 of about 138 (67)

An ellipsoidal branch and bound algorithm for global optimization

, 2009
A branch and bound algorithm is developed for global optimization. Branching in the algorithm is accomplished by subdividing the feasible set using ellipses.
Hager, William, Phan, Dzung
core   +1 more source

A polyhedral approach for the Equitable Coloring Problem [PDF]

, 2011
In this work we study the polytope associated with a 0,1-integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and derive sufficient conditions in order to be facet-defining inequalities.
Bahiense, Campêlo, Daniel Severín, Das, Graciela Nasini, Isabel Méndez-Díaz, Januschowski, Kaibel, Kierstead, Kubale, Lih, Margot, Meyer, Méndez-Díaz, Pemmaraju, Tucker   +15 more
core   +2 more sources

Integer Polynomial Optimization in Fixed Dimension

, 2004
We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed.
Barvinok A. I., Barvinok A. I., de Klerk E., Garey M. R., Jesús A. De Loera, Jones J. P., Matiyasevich Y., Matthias Köppe, Raymond Hemmecke, Robert Weismantel   +9 more
core   +4 more sources

A min-max theorem on tournaments [PDF]

, 2007
We present a structural characterization of all tournaments T = (V, A) such that, for any nonnegative integral weight function defined on V, the maximum size of a feedback vertex set packing is equal to the minimum weight of a triangle in T.
Chen, X, Hu, X, Zang, W
core   +1 more source

FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension

, 2006
We show the existence of a fully polynomial-time approximation scheme (FPTAS) for the problem of maximizing a non-negative polynomial over mixed-integer sets in convex polytopes, when the number of variables is fixed.
A.I. Barvinok, D.A. Cox, E. de Klerk, H.W. Lenstra Jr., J. Renegar, J. Renegar, J. Renegar, J. Renegar, J.A. De Loera, J.A. De Loera, J.A. De Loera, J.P. Jones, Jesús A. De Loera, M.R. Garey, Matthias Köppe, Raymond Hemmecke, Robert Weismantel, Y.V. Matiyasevich   +17 more
core   +2 more sources

The Maximum-Weight Stable Matching Problem: Duality and Efficiency [PDF]

, 2012
Given a preference system (G,≺) and an integral weight function defined on the edge set of G (not necessarily bipartite), the maximum-weight stable matching problem is to find a stable matching of (G,≺) with maximum total weight.
Chen, X, Ding, G, Hu, X, Zang, W
core   +2 more sources

A Polyhedral Description of Kernels [PDF]

, 2016
postprin
Chen, Q, Chen, X, Zang, W
core   +1 more source

Planeación de sistemas secundarios de distribución usando el algoritmo Branch and Bound

Ingeniería y Ciencia, 2011
En este trabajo se plantea una metodología para la solución del problema delplaneamiento de sistemas secundarios de distribución considerando un modelode programación lineal entero mixto (PLEM), el cual considera la ubicación y dimensionamiento de ...
Carlos Javier Tapias-Isaza, Andrés Alberto Galeano-Ossa, Ricardo Alberto Hincapie Isaza   +2 more
doaj  

Clique-circulants and the stable set polytope of fuzzy circular interval graphs [PDF]

, 2008
In this paper, we give a complete and explicit description of the rank facets of the stable set polytope for a class of claw-free graphs, recently introduced by Chudnovsky and Seymour (Proceedings of the Bristish Combinatorial Conference, 2005), called ...
Oriolo, G, Stauffer, G
core   +1 more source

A conical branch-and-bound algorithm for a class of reverse convex programs [PDF]

, 2005
technical ...
KUNO Takahito, Nagai Hidetoshi
core