Results 21 to 30 of about 118 (48)
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 +15 more
core +2 more sources
Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
, 2011 We investigate the use of linear programming tools for solving semidefinite programming relaxations of quadratically constrained quadratic problems. Classes of valid linear inequalities are presented, including sparse PSD cuts, and principal minors PSD ...
Belotti, Pietro +2 more
core +2 more sources
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 +17 more
core +2 more sources
Vertex adjacencies in the set covering polyhedron [PDF]
, 2017 We describe the adjacency of vertices of the (unbounded version of the) set covering polyhedron, in a similar way to the description given by Chvatal for the stable set polytope.
Aguilera, Néstor E. +2 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
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
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 +2 more
doaj
Rounding-based heuristics for nonconvex MINLPs [PDF]
, 2016 We propose two primal heuristics for nonconvex mixed-integer nonlinear programs. Both are based on the idea of rounding the solution of a continuous nonlinear program subject to linear constraints.
Belotti, Pietro, Nannicini, Giacomo
core +1 more source
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
Mathematical Optimization for the Train Timetabling Problem [PDF]
, 2010 AMS Subj. Classification: 90C57; 90C10;Rail transportation is very rich in terms of problems that can be modelled and solved using mathematical optimization techniques. The train scheduling problem as the most important part of a rail operating policy has
Bojović, Nebojša +4 more
core