The following pages link to (Q2713942):
Displayed 15 items.
- Solving a bicriteria problem of optimal service centers location (Q367241) (← links)
- Analysis and solving SAT and MAX-SAT problems using an \(L\)-partition approach (Q367248) (← links)
- Estimation of the number of iterations in integer programming algorithms using the regular partitions method (Q463771) (← links)
- Analysis of fractional covering of some supply management problems (Q853804) (← links)
- Optimization models of anti-terrorist protection (Q1735316) (← links)
- Analysis of integer programming algorithms with \(L\)-partition and unimodular transformations (Q2261724) (← links)
- Optimization of the number and arrangement of circles of two radii for forming a \(k\)-covering of a bounded set (Q2332657) (← links)
- On the stability of some integer programming algorithms (Q2387059) (← links)
- The three-dimensional assignment and partition problems. New lower bounds (Q2457504) (← links)
- On a minimization problem for a set of Boolean functions (Q3186833) (← links)
- On the Number and Arrangement of Sensors for the Multiple Covering of Bounded Plane Domains (Q4973240) (← links)
- Particular Structures of the Pareto Set and Its Reduction in Bicriteria Discrete Problems (Q5054515) (← links)
- Numerical methods for constructing suboptimal packings of nonconvex domains with curved boundary (Q5090167) (← links)
- The reduction of the Pareto set of a special structure in bicriteria discrete problems (Q5100140) (← links)
- Proof of covering minimality by generalizing the notion of independence (Q5373999) (← links)