scientific article
From MaRDI portal
Publication:2713942
zbMath0962.90039MaRDI QIDQ2713942
Alexander A. Kolokolov, Anton Valentinovich Eremeev, Lidia A. Zaozerskaya
Publication date: 10 June 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Integer programming (90C10) Permutations, words, matrices (05A05) Combinatorial optimization (90C27)
Related Items (15)
Particular Structures of the Pareto Set and Its Reduction in Bicriteria Discrete Problems ⋮ Analysis of fractional covering of some supply management problems ⋮ On a minimization problem for a set of Boolean functions ⋮ On the stability of some integer programming algorithms ⋮ Solving a bicriteria problem of optimal service centers location ⋮ Analysis and solving SAT and MAX-SAT problems using an \(L\)-partition approach ⋮ Numerical methods for constructing suboptimal packings of nonconvex domains with curved boundary ⋮ The reduction of the Pareto set of a special structure in bicriteria discrete problems ⋮ Proof of covering minimality by generalizing the notion of independence ⋮ Estimation of the number of iterations in integer programming algorithms using the regular partitions method ⋮ The three-dimensional assignment and partition problems. New lower bounds ⋮ Optimization models of anti-terrorist protection ⋮ Analysis of integer programming algorithms with \(L\)-partition and unimodular transformations ⋮ On the Number and Arrangement of Sensors for the Multiple Covering of Bounded Plane Domains ⋮ Optimization of the number and arrangement of circles of two radii for forming a \(k\)-covering of a bounded set
This page was built for publication:
