Results 21 to 30 of about 411 (101)
Sufficient pruning conditions for MINLP in gas network design
EURO Journal on Computational Optimization, 2017 One-quarter of Europe’s energy demand is provided by natural gas distributed through a vast pipeline network covering the whole of Europe. At a cost of 1 million Euros per kilometer the extension of the European pipeline network is already a multi ...
Jesco Humpola, Felipe Serrano
doaj +1 more source
The summed start-up costs in a unit commitment problem
EURO Journal on Computational Optimization, 2017 We consider the sum of the incurred start-up costs of a single unit in a Unit Commitment problem. Our major result is a correspondence between the facets of its epigraph and some binary trees for concave start-up cost functions CU, which is bijective if ...
René Brandenberg +2 more
doaj +1 more source
Towards optimizing the deployment of optical access networks
EURO Journal on Computational Optimization, 2014 In this paper we study the cost-optimal deployment of optical access networks considering variants of the problem such as fiber to the home (FTTH), fiber to the building (FTTB), fiber to the curb (FTTC), or fiber to the neighborhood (FTTN).
Martin Grötschel +2 more
doaj +1 more source
2-D non-periodic homogenization of the elastic wave equation: SH case [PDF]
, 2010 International audienceIn the Earth, seismic waves propagate through 3-D heterogeneities characterized by a large variety of scales, some of them much smaller than their minimum wavelength.
Capdeville, Yann +2 more
core +3 more sources
EURO Journal on Computational Optimization, 2018 An elementary, but fundamental, operation in disjunctive programming is a basic step, which is the intersection of two disjunctions to form a new disjunction.
DimitriJ. Papageorgiou +1 more
doaj +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 +17 more
core +2 more sources
Solving Mixed--integer Control Problems by Sum Up Rounding With Guaranteed Integer Gap [PDF]
, 2007 Probleme der Optimalen Steuerung, die zeitabhaengige diskrete Entscheidungen beinhalten, haben in letzter Zeit zunehmend Beachtung gefunden, da sie in praktischen Anwendungen mit hohem Potential fuer Optimierung auftreten.
Bock, Hans Georg +2 more
core +1 more source
An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size [PDF]
, 2001 Given a complete undirected graph with the nodes partitioned into m node sets called clusters, the Generalized Minimum Spanning Tree problem denoted by GMST is to find a minimum-cost tree which includes exactly one node from each cluster.
Kern, W., Pop, P.C., Still, G.J.
core +1 more source
Transversal numbers over subsets of linear spaces [PDF]
, 2009 Let $M$ be a subset of $\mathbb{R}^k$. It is an important question in the theory of linear inequalities to estimate the minimal number $h=h(M)$ such that every system of linear inequalities which is infeasible over $M$ has a subsystem of at most $h ...
Averkov, Gennadiy, Weismantel, Robert
core
Speeding up column generation for robust wireless network planning
EURO Journal on Computational Optimization, 2013 The wireless network planning problem consists of base station placement and traffic node assignment to base stations. To incorporate traffic demand uncertainties, we follow the Γ-robustness approach by Bertsimas and Sim.
Grit Claßen +2 more
doaj +1 more source