✦ LIBER ✦

Solving methods of combinatorial geometric problems

✍ Scribed by Ingrida Veilande

Book ID: 110608832
Publisher: Springer-Verlag
Year: 2006
Tongue: English
Weight: 213 KB
Volume: 38
Category: Article
ISSN: 1863-9690
DOI: 10.1007/bf02652786

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

ON THE POSSIBILITIES OF SOLVING COMBINAT

ON THE POSSIBILITIES OF SOLVING COMBINATORIAL PROBLEMS BY ANALYTIC METHODS

✍ P. L. Buzytsky; Gregory A. Freiman 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 306 KB

Decomposition method of solving a class

Decomposition method of solving a class of combinatorial optimization problems

✍ V. L. Kravets; I. V. Sergienko 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 415 KB

Combinatorial and Geometric Methods in T

Combinatorial and Geometric Methods in Topology

✍ Carlo Petronio; Damian Heard; Ekaterina Pervova 📂 Article 📅 2007 🏛 SP Birkhäuser Verlag Basel 🌐 English ⚖ 207 KB

Solving combinatorial problems: The 15-p

Solving combinatorial problems: The 15-puzzle

✍ Zygmunt Pizlo; Zheng Li 📂 Article 📅 2005 🏛 Psychonomic Society Publications 🌐 English ⚖ 296 KB

MOSA method: a tool for solving multiobj

MOSA method: a tool for solving multiobjective combinatorial optimization problems

✍ E.L. Ulungu; J. Teghem; P.H. Fortemps; D. Tuyttens 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 189 KB 👁 2 views

The success of modern heuristics (Simulated Annealing (S.A.), Tabu Search, Genetic Algorithms, . . . ) in solving classical combinatorial optimization problems has drawn the attention of the research community in multicriteria methods. In fact, for large-scale problems, the simultaneous difficultie

On some metric and combinatorial geometr

On some metric and combinatorial geometric problems

✍ P. Erdös 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 515 KB

Let x1, , x, be n distinct points in the plane. Denote by D(x,, ,x,) the minimum number of distinct distances determined by x1, , x,. Put f(n) = min D(x,,