Results 31 to 40 of about 132 (51)

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 branch-and-cut algorithm for the target visitation problem

EURO Journal on Computational Optimization, 2019
In this paper, we consider the target visitation problem (TVP) which arises in the context of disaster treatment. Mathematically speaking, the problem is concerned with finding a route to visit a set of targets starting from and returning to some base ...
Achim Hildenbrandt
doaj  

A polyhedral approach to computing border bases [PDF]

, 2010
Border bases can be considered to be the natural extension of Gr\"obner bases that have several advantages. Unfortunately, to date the classical border basis algorithm relies on (degree-compatible) term orderings and implicitly on reduced Gr\"obner bases.
Braun, Gábor, Pokutta, Sebastian
core  

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

On positivity of Ehrhart polynomials

, 2018
Ehrhart discovered that the function that counts the number of lattice points in dilations of an integral polytope is a polynomial. We call the coefficients of this polynomial Ehrhart coefficients, and say a polytope is Ehrhart positive if all Ehrhart ...
Alexander Postnikov, Benjamin Braun, Christian Bey, Clara S. Chan, E Ehrhart, Etienne Rassart, F Castillo, Federico Ardila, Federico Castillo, Federico Castillo, FR Rodriguez-Villegas, Fu Liu, Fu Liu, Fu Liu, Fu Liu, Günter M. Ziegler, Harm Derksen, Heinke Conrads, I. G. MacDonald, I. Pak, J. Haglund, Jaron Treutlein, Jeffrey R. Schmidt, Karola Mészáros, Karola Mészáros, Karola Mészáros, Lucia Moura, Matthias Beck, Matthias Beck, N. Berline, P. McMullen, P.R. Scott, Persi Diaconis, Petter Branden, R. King, Richard P Stanley, RICHARD P. STANLEY, Richard P. Stanley, Richard P. Stanley, Richard P. Stanley, Robert Steinberg, Sam Payne, Sylvain E. Cappell, T Hibi, T. Hibi, Takayuki Hibi, Takayuki Hibi, Takayuki Hibi, Welleda Baldoni   +48 more
core   +1 more source

VNS-BASED ALGORITHMS FOR THE CENTROID-BASED CLUSTERING PROBLEM [PDF]

, 2019
The k-means algorithm with the corresponding problem formulation is one of the first methods that researchers use when solving a new automatic grouping (clus-tering) problem. Its improvement, modification and combination with other algorithms are described
Kazakovtsev, Lev A., Orlov, Victor I., Rozhnov, Ivan P.   +2 more
core   +1 more source

On the even permutation polytope [PDF]

We consider the convex hull of the even permutations on a set of n elements. We define a class of valid inequalities and prove that they induce a large class of distinct facets of the polytope. Using the inequalities, we characterize the polytope for n=4,
Cunningham, William H, Wang, Yaoguang
core   +1 more source

Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems [PDF]

, 2018
We consider the problem of optimizing a novel acoustic leakage detection system for urban water distribution networks. The system is composed of a number of detectors and transponders to be placed in a choice of hydrants such as to provide a desired ...
DeNegre, Scott, Liebling, Thomas, Prodon, Alain   +2 more
core  

Complexity of linear relaxations in integer programming. [PDF]

Math Program, 2022
Averkov G, Schymura M.
europepmc   +1 more source

Idealness of k-wise intersecting families. [PDF]

Math Program, 2022
Abdi A, Cornuéjols G, Huynh T, Lee D.
europepmc   +1 more source