Results 1 to 10 of about 104 (98)

Proximity and Flatness Bounds for Linear Integer Optimization

Mathematics of Operations Research
Joseph Paat, Marcel Celaya, Robert Weismantel   +2 more
exaly  

Periodicity and the values of the real Buchstaber invariants

Journal of the Mathematical Society of Japan, 2016
exaly  

Teaching Integer Programming Formulations Using the Traveling Salesman Problem

SIAM Review, 2003
exaly  

Sparse Integer Programming Is Fixed-Parameter Tractable

Mathematics of Operations Research
Christoph Hunkenschröder, Friedrich Eisenbrand, Asaf Levin   +2 more
exaly  

Nash equilibria sets in mixed extension of 2x2x2 games [PDF]

Computer Science Journal of Moldova, 2005
We describe the Nash equilibria set as an intersection of graphs of players' best responses. The problem of Nash equilibria set construction for three-person extended 2 2 2 games is studied.
Valeriu Ungureanu, Ana Botnari
doaj   +1 more source

Quasi-stability of a vector trajectorial problem with non-linear partial criteria [PDF]

Computer Science Journal of Moldova, 2003
Multi-objective (vector) combinatorial problem of finding the Pareto set with four kinds of non-linear partial criteria is considered. Necessary and sufficient conditions of that kind of stability of the problem (quasi-stability) are obtained.
Vladimir A. Emelichev, Kirill E. Kovalenko   +1 more
doaj   +1 more source

On quasistability of a vector combinatorial problem with \Sigma-MINMAX and \Sigma-MINMIN partial criteria [PDF]

Computer Science Journal of Moldova, 2004
We consider one type of stability (quasistability) of a vector combinatorial problem of finding the Pareto set. Under quasistability we understand a discrete analogue of lower semicontinuity by Hausdorff of the many-valued mapping, which defines the ...
Vladimir A. Emelichev, Kirill G. Kuzmin, Andrey M. Leonovich   +2 more
doaj   +1 more source

Measure of stability of a Pareto optimal solution to a vector integer programming problem with fixed surcharges in the l1 and l∞ metrics [PDF]

Computer Science Journal of Moldova, 2005
In this paper we consider a vector integer programming problem with Pareto principle of optimality for the case where partial criteria belong to the class of separable piecewise linear functions. The limit level of the initial data's perturbations in the
Vladimir A. Emelichev, Olga V. Karelkina, Kirill G. Kuzmin   +2 more
doaj   +1 more source

On stability of an optimal situation in a finite cooperative game with a parametric concept of equilibrium (from lexicographic optimality to Nash equilibrium) [PDF]

Computer Science Journal of Moldova, 2005
A parametric concept of equilibrium (principle of optimality) in a finite cooperative game in normal form of several players is introduced. This concept is defined by means of the partition of players into coalitions.
Sergey E. Bukhtoyarov, Vladimir A. Emelichev   +1 more
doaj   +2 more sources

On quasistability radius of a vector trajectorial problem with a principle of optimality generalizing Pareto and lexicographic principles [PDF]

Computer Science Journal of Moldova, 2005
A multicriterion linear combinatorial problem with a parametric principle of optimality is considered. This principle is defined by a partitioning of partial criteria onto Pareto preference relation groups within each group and the lexicographic ...
Sergey E. Bukhtoyarov, Vladimir A. Emelichev   +1 more
doaj   +2 more sources