Filters








35 Hits in 6.2 sec

14th International Symposium on Mathematical Programming

1990 Mathematical programming  
It is shown that for the success of the variant dom must ful ll a regularity property and that the choice of the normal vectors must meet some demands.Both requirements are ful lled if dom is polyhedral  ...  Finally I report numerical results of a comparison between the variant and a minimization approach using penalty functions.  ...  present a branch-and-cut algorithm to solve capacitated network design problems.  ... 
doi:10.1007/bf01580875 fatcat:3jtclwmntzgjxkqs5uecombdaa

Arc Flow Formulations Based on Dynamic Programming: Theoretical Foundations and Applications [article]

Vinícius L. de Lima, Cláudio Alves, François Clautiaux, Manuel Iori, José M. Valério de Carvalho
2021 arXiv   pre-print
The relation with DP also allows a new perspective to relate state-space relaxation methods for DP with arc flow models.  ...  For 𝒩𝒫-hard problems, polynomial-sized arc flow models typically provide weak linear relaxations and may have too much symmetry to be efficient in practice.  ...  The second and the fifth authors have been supported by FCT -Fundação para a Ciência e Tecnologia within the R&D Units Project Scope: UIDB/00319/2020.  ... 
arXiv:2010.00558v2 fatcat:fplyye4gkbcb3cyufmtxanofkm

Minimum color‐degree perfect b ‐matchings

Mariia Anapolska, Christina Büsing, Martin Comis, Tabea Krabs
2020 Networks  
then possibly someone will ask a question just to fill in the horrible silence, and then other questions may follow.  ...  Conversely, if a speaker ends before the time is up, you should encourage some questions/discussion/debate: e.g. invite questions from the audience and leave a pause long enough to be slightly awkward,  ...  We have developed a column génération approach to solve the problem, introduced new classes of valid inequalities, and gived separation algorithms for a branch-and-cut-and-price framework.  ... 
doi:10.1002/net.21974 fatcat:4qgtutmxrrcy7anvxks4fivcii

Combinatorial Problems in Chip Design [chapter]

Bernhard Korte, Jens Vygen
2008 Bolyai Society Mathematical Studies  
We give some partial results and argue why a full resolution of one of the problems could result in an advance of the state of the art in algorithms for chip design.  ...  We present some important and challenging open problems in various areas of chip design.  ...  (M, N , γ) is called a netlist; it can be regarded as a hypergraph with a special vertex 2 Task Compute • a placement (x, y) : M → A(2) such that (x(m) + w(m), y(m) + h(m)) ∈ A(2) for each m ∈ M , and  ... 
doi:10.1007/978-3-540-85221-6_12 fatcat:v4bdszflz5bbxadgevt5fdetqy

Recent developments in kernelization: A survey

Stefan Kratsch
2014 Bulletin of the European Association for Theoretical Computer Science  
A fundamental technique in the design of parameterized algorithms is kernelization: Given a problem instance I with parameter k, the basic idea is to try and preprocess the instance I of length n by applying  ...  A brute-force/exponential-time algorithm can then be used to solve the kernel instance. Smaller kernels often lead to faster algorithms. How small, as a function of k, can kernels be made?  ...  Acknowledgements The author is indebted to Andrew Drucker and Magnus Wahlström for several discussions and comments that greatly improved this survey.  ... 
dblp:journals/eatcs/Kratsch14 fatcat:7hpcf4kyvvgi5ku3iueodwrpku

On a new class of nonlinear set covering problems arising in wireless network design

Sandro Bosio
2007 4OR  
The Branch-and-Price algorithm improves from three different point of views.  ...  Since the formulation SFWDP-L b3 is enumerative, it is natural to design a Branch-and-Price algorithm.  ...  The 40 instances are separated in 8 classes of 5 instances, according to the instance size, divideed in two density classes A and B according to the instance density ρ, that is the average of the ratio  ... 
doi:10.1007/s10288-007-0052-6 fatcat:lhfgqdnrljha5fra6qdjgdvyhm

The Vessel Schedule Recovery Problem (VSRP) – A MIP model for handling disruptions in liner shipping

Berit D. Brouer, Jakob Dirksen, David Pisinger, Christian E.M. Plum, Bo Vaaben
2013 European Journal of Operational Research  
We propose a divisible load model and give an algorithm for scheduling multilayer divisible computations. The algorithm is tested experimentally.  ...  The proposed model incorporates a matching algorithm between the supply and demand, finding the most adequate option, considering multiple objectives, as minimum travel time for passengers and balance  ...  -Optimal Dynamic Tax Evasion: A Portfolio Approach Francesco Menoncin, Economics, Brescia University, Via S. Faustino, 74/B, 25122, Brescia, Italy, menoncin@eco.unibs.it, Rosella Levaggi  ... 
doi:10.1016/j.ejor.2012.08.016 fatcat:c27kagfnxnhjfbil2rydhjhomm

Reference list of indexed articles

2000 Discrete Applied Mathematics  
Sen and H.D. Sherali, A branch and bound algorithm for extreme point mathematical programming problems 11 (1985) 265-280 312. G.  ...  Roucairol, A parallel branch and bound algorithm for the quadratic assignment problem 18 (1987) 21 l-225 490. J.L.  ... 
doi:10.1016/s0166-218x(00)00209-2 fatcat:l53yxlj45ffdrdecl3uah2gj3y

Modelling and Discretization of Circuit Problems [chapter]

Michael Günther, Uwe Feldmann, Jan ter Maten
2005 Handbook of Numerical Analysis  
It starts from a vertex of a weighted network graph, and adds that neighbour vertex to the cluster, which provides the minimal number of edges to the vertices outside the cluster.  ...  However, we will point out also that the separate algorithms are a step in a larger process: distortion analysis, immunity analysis, noise analysis.  ... 
doi:10.1016/s1570-8659(04)13006-8 fatcat:h3l2jw323rbnbdz7y5wec3zitm

Decomposition and reformulation of integer linear programming problems

Fabio Furini
2011 4OR  
Degraeve : A New Dantzig-Wolfe Reformulation and Branch-and- Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times Operations Research, 2007, 909-921 [34] Z.  ...  The algorithm that combines column generation and branch and bound is known as branch and price.  ... 
doi:10.1007/s10288-011-0178-4 fatcat:cp6c7sxqg5gudftye4ek5bedo4

Approximating Binary Images from Discrete X-Rays

Peter Gritzmann, Sven de Vries, Markus Wiegelmann
2000 SIAM Journal on Optimization  
For these (NP-hard) optimization problems we present various approximation algorithms and provide estimates for their worst-case performance.  ...  This inverse discrete problem belongs to a class of generalized set partitioning problems and allows natural packing and covering relaxations.  ...  We thank Jens Zimmermann for helping with coding the data structures and algorithms. Furthermore, we thank the referees for some valuable comments.  ... 
doi:10.1137/s105262349935726x fatcat:ezgrfpqhmzeivazeqomie6tnrq

Contents

2012 Procedia Engineering  
New Algorithm for Blind Signal Separation based on Relative Newton Method and Maximum Likelihood Criterion Y.  ...  Matching Algorithm for Multilevel Partitioning of Network Topology A.  ... 
doi:10.1016/s1877-7058(12)01003-x fatcat:h3tienvctfgkpkwmhui6bgs4ee

Page 2546 of Mathematical Reviews Vol. , Issue Subject Index [page]

Mathematical Reviews  
Vanderbeck, Francois On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm. (English summary) 2001¢:90045 Volgenant, A.  ...  A., 2001j:90001 Rénnqvist, Mikael see Tragantalerngsak, Suda et al. Rossi, Fabrizio (with Smriglio, S.) A branch-and-cut algorithm for the maximum cardinality stable set problem.  ... 

Models and algorithms for decomposition problems

Paolo Paronuzzi
2020
Giacomo Nannicini who agreed to be my tutor for the five months I spent in New York as a trainee at the IBM T.J. Watson research center. He made my experience very productive and formative.  ...  In particular, I take this opportunity to thank Fabio and Michele who also found the time to give me important advices and recommendations for my current and future academic career.  ...  In this paper, the k-VSP has been called the Capacitated Hypergraph Vertex Separator problem and a branch-and-price algorithm has been designed based on specialized algorithms to solve the pricing problems  ... 
doi:10.6092/unibo/amsdottorato/9330 fatcat:rgb74swrpvcvncnny75ehtyayy

Fast and Eager k-Medoids Clustering: O(k) Runtime Improvement of the PAM, CLARA, and CLARANS Algorithms [article]

Erich Schubert, Peter J. Rousseeuw
2020 arXiv   pre-print
In Euclidean geometry the mean-as used in k-means-is a good estimator for the cluster center, but this does not exist for arbitrary dissimilarities.  ...  In experiments on real data with k=100,200, we observed a 458x respectively 1191x speedup compared to the original PAM SWAP algorithm, making PAM applicable to larger data sets, and in particular to higher  ...  Beasley (1985) used a Cray-1S supercomputer to find the exact solution for such problems with up to 900 instances with a branch-and-bound approach.  ... 
arXiv:2008.05171v1 fatcat:gqgfvrby5fheveijf5wc27f4m4
« Previous Showing results 1 — 15 out of 35 results