✦ LIBER ✦

On the Hamming distance in combinatorial optimization problems on hypergraph matchings

✍ Scribed by Alla Kammerdiner; Pavlo A. Krokhmal; Panos M. Pardalos

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the depth of combinatorial optimizati

✍ W. Kern 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 845 KB

On local optima in multiobjective combin

✍ Luis Paquete; Tommaso Schiavinotto; Thomas Stützle 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 421 KB

On an optimization problem occurring in

✍ D. de Werra 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 340 KB

On the variance of average distance of s

✍ Fang-Wei Fu; San Ling; Chaoping Xing 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 215 KB

On the use of optimal fractional matchin

✍ U. Derigs; A. Metz 📂 Article 📅 1986 🏛 Springer Vienna 🌐 English ⚖ 394 KB

On the complexity of a class of combinat

✍ Igor Averbakh 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 110 KB