Results 31 to 40 of about 119 (48)

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, Kratica, Jozef, Marić, Miroslav, Milenković, Miloš, Stanojević, Predrag   +4 more
core  

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

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

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

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  

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

Border bases and order ideals: a polyhedral characterization

, 2015
Border bases arise as a canonical generalization of Gr\"obner bases. We provide a polyhedral characterization of all order ideals (and hence border bases) that are supported by a zero-dimensional ideal: order ideals that support a border basis correspond
Braun, Gábor, Pokutta, Sebastian
core   +1 more source

D.C. Optimization methods for minimum maximal flow problem [PDF]

, 2004
This paper is concerned with the minimum maximal flow problem, i.e., a problem of minimizing the flow value attained by a maximal flow for agiven network.
Yamamoto Yoshitsugu, Zenke Daisuke, 山本 芳嗣   +2 more
core  

Volume of Hypercubes Clipped by Hyperplanes and Combinatorial Identities

, 2017
There was an elegant expression for the volume of hypercube $[0,1]^n$ clipped by a hyperplane. We generalize the formula to the case of more than one hyperplane.
Cho, Yunhi, Kim, Seonhwa
core  

Complexity of linear relaxations in integer programming. [PDF]

Math Program, 2022
Averkov G, Schymura M.
europepmc   +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