Search
Search Results
-
A problem of Erdős and Sós on 3-graphs
We show that for every ɛ > 0 there exist δ > 0 and n 0 ∈ ℕ such that every 3-uniform hypergraph on n ≥ n 0 vertices with the property that every k -ver...
-
An approximate version of the tree packing conjecture
We prove that for any pair of constants ɛ > 0 and Δ and for n sufficiently large, every family of trees of orders at most n , maximum degrees at most...
-
Supermodular programming on finite lattices
There is a discription of the problems of minimization of supermodular functions on the different types of lattices: Boolean lattices, lattices with...
-
Combinatorial optimization in system configuration design
The significance of systems configurations has been increased in many applied domains (e.g., software, hardware, manufacturing systems, communication...
-
-
Zwei auf einen Streich: Optimierte dynamische Einsatzplanung für Gelbe Engel und Lastenaufzüge
We present a unified model for two dynamic dispatching problems: the dynamic dispatching of automobile service vehicles at the German Automobile...
-
Stability of Discrete Vector Problems with the Parametric Principle of Optimality
The paper presents a survey of analysis of different types of stability in vector (multiple-criteria) combinatorial problem with the parametrized...
-
Improving Customer Proximity to Railway Stations
We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of...
-
Optimal Scheduling in Parallel and Serial Manufacturing Systems via the Maximum Principle
The problems of M -machine, J -product, N -time point preemptive scheduling in parallel and serial production systems are the focus of this paper. The...