Results 11 to 20 of about 143 (125)
EURO Journal on Computational Optimization, 2021 A conic optimization problem is a problem involving a constraint that the optimization variable be in some closed convex cone. Prominent examples are linear programs (LP), second order cone programs (SOCP), semidefinite problems (SDP), and copositive ...
Mirjam Dür, Franz Rendl
doaj +1 more source
Decomposing tournaments into paths
Proceedings of the London Mathematical Society, Volume 121, Issue 2, Page 426-461, August 2020., 2020 Abstract We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from 1976. Kelly's conjecture states that every regular tournament has an edge decomposition into Hamilton cycles, and this was proved by Kühn and Osthus for large tournaments. The conjecture of Alspach, Mason, and Pullman asks for the minimum number
Allan Lo +3 more
wiley +1 more source
Advances in Industrial and Manufacturing Engineering, 2021 The cutting process is an important stage of the industries which are dealing with cutting of small pieces from large items in such a way so that the wastage should be minimum.
Ravi Vishwakarma, P.L. Powar
doaj +1 more source
Computational experiments with a lazy version of a K quickest simple path ranking algorithm [PDF]
, 2007 Graph algorithms, Networks, Quickest path, Ranking, 90C27, 90C35,
Pascoal, M. +7 more
core +1 more source
Mobility offer allocations in corporate settings
EURO Journal on Computational Optimization, 2021 Corporate mobility is often based on a fixed assignment of vehicles to employees. Relaxing this fixation and including alternatives such as public transportation or taxis for business and private trips could increase fleet utilization and foster the use ...
Sebastian Knopp +2 more
doaj +1 more source
Extended blocker, deletion, and contraction maps on antichains
International Journal of Mathematics and Mathematical Sciences, Volume 2003, Issue 10, Page 607-616, 2003., 2003 Families of maps on the lattice of all antichains of a finite bounded poset that extend the blocker, deletion, and contraction maps on clutters are considered. Influence of the parameters of the maps is investigated. Order‐theoretic extensions of some principal relations for the set‐theoretic blocker, deletion, and contraction maps on clutters are ...
Andrey O. Matveev
wiley +1 more source
A note on operators of deletion and contraction for antichains
International Journal of Mathematics and Mathematical Sciences, Volume 31, Issue 12, Page 725-729, 2002., 2002 The operators of deletion and contraction for clutters are generalized to those for antichains of finite bounded posets. A generalization of the result by Seymour (1976), describing the relationship between the operators of deletion, contraction, and the blocker map, is considered as a comparison in the lattice of antichains of a poset.
Andrey O. Matveev
wiley +1 more source
International Journal of Mathematics and Mathematical Sciences, Volume 26, Issue 10, Page 581-588, 2001., 2001 Antichains of a finite bounded poset are assigned antichains playing a role analogous to that played by blockers in the Boolean lattice of all subsets of a finite set. Some properties of lattices of generalized blockers are discussed.
Andrey O. Matveev
wiley +1 more source
EURO Journal on Computational Optimization, 2018 An instance of a balanced optimization problem with vector costs consists of a ground set X, a cost-vector for every element of X, and a system of feasible subsets over X.
AnnetteM.C. Ficker +2 more
doaj +1 more source
Robust combinatorial optimization under budgeted–ellipsoidal uncertainty
EURO Journal on Computational Optimization, 2018 In the field of robust optimization, uncertain data are modeled by uncertainty sets which contain all relevant outcomes of the uncertain problem parameters. The complexity of the related robust problem depends strongly on the shape of the chosen set. Two
Jannis Kurtz
doaj +1 more source