M. K. Kravtsov

From MaRDI portal
Revision as of 18:40, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:179196

Available identifiers

zbMath Open kravtsov.mikhail-konstantinovichMaRDI QIDQ179196

List of research outcomes





PublicationDate of PublicationType
Characterization of the types of maximum noninteger vertices in the relaxation polyhedron of the four-index axial assignment problem2014-04-28Paper
Types of maximum noninteger vertices of the relaxation polyhedron of the four-index axial assignment problem2012-11-20Paper
Polyhedral combinatorics of multi-index axial transportation problems2008-04-24Paper
Investigation of polynomial algorithms for solving the multicriteria three-index planar assignment problem2008-01-22Paper
https://portal.mardi4nfdi.de/entity/Q53109342007-10-15Paper
On the noninteger polyhedron vertices of the three-index axial transportation problem2005-08-08Paper
A multicriteria approach to optimization of the gross domestic product2005-06-17Paper
Asymptotic approach to the solution of a multicriterion three-index planar problem of choice2005-06-07Paper
https://portal.mardi4nfdi.de/entity/Q46583462005-03-16Paper
https://portal.mardi4nfdi.de/entity/Q48211732004-10-11Paper
https://portal.mardi4nfdi.de/entity/Q48212122004-10-11Paper
On non-integer vertices of the polytope of the three-index axial assignment problem2004-08-30Paper
https://portal.mardi4nfdi.de/entity/Q44687752004-06-11Paper
https://portal.mardi4nfdi.de/entity/Q44639712004-05-27Paper
Conditions for Pareto optimality in a discrete vector problem on a system of subsets2003-12-10Paper
Types of \((3n-2)\)-noninteger vertices of the polytope of three-index axial problem of choice2003-11-13Paper
Polynomial algorithm for finding an asymptotically optimal solution to the multi-index planar choice problem.2003-06-26Paper
A counter-example to the hypothesis on the maximum number of integer vertices of a multi-index axial transportation polytope2002-12-17Paper
https://portal.mardi4nfdi.de/entity/Q47788562002-11-21Paper
https://portal.mardi4nfdi.de/entity/Q45461862002-08-19Paper
Remark on the paper ``A polynomial algorithm for the multi-index choice problem2002-08-12Paper
Stability, pseudostability, and quasistability of a multicriterial problem on a system of subsets2001-09-10Paper
On some properties of three-index transportation polytopes2001-08-20Paper
Asymptotic approach to solving the multi-index axial transportation problem2001-08-14Paper
Asymptotic behaviour of multi-index axial transportation polyhedra2001-08-14Paper
A polynomial algorithm for the multi-index decision problem2001-06-20Paper
Noninteger vertices of the polytope of multi-index axial choice problem2001-03-07Paper
A linear convolution of criteria in bicriterial optimization.2000-12-12Paper
Asymptotic optimality of a transport-problem plan constructed by the minimum-element method2000-10-29Paper
Solvability of a class of discrete vector problems by the algorithms of linear convolution of criteria2000-07-04Paper
Conditions of solvability of vector problems using linear convolution of criteria2000-06-06Paper
The number of \(r\)-fractional vertices of polytopes of three-index axial choice problem.2000-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42465071999-06-01Paper
On the quasistability of trajectory problems of vector optimization1999-03-09Paper
Unsolvability of vector discrete optimization problems in the class of algorithms of linear convolution of criteria1997-03-23Paper
Solvability of the vector problem by the linear criteria convolution algorithm1997-01-01Paper
Stability in vector optimization path problems1996-08-25Paper
https://portal.mardi4nfdi.de/entity/Q48889611996-08-25Paper
Lexicographic optima in the multicriteria discrete optimization problem1996-08-12Paper
Problems of discrete vector optimization on systems of subsets which cannot be solved using a linear convolution algorithm1996-04-01Paper
On combinatorial vector optimization problems1996-01-28Paper
On the number of bases of the transportation problem with prohibitions1996-01-15Paper
Completeness of vector discrete optimization problems1996-01-08Paper
https://portal.mardi4nfdi.de/entity/Q48512281995-11-02Paper
https://portal.mardi4nfdi.de/entity/Q38356931995-04-26Paper
On transportation polytopes with the minimum number of k-faces1994-09-07Paper
https://portal.mardi4nfdi.de/entity/Q43014701994-07-21Paper
A proof of the Hirsch conjecture for one class of transportation polytopes1993-04-01Paper
Multi-index planar transportation polytopes with maximum number of vertices1993-01-16Paper
Solution of combinatorial optimization problems with minimax criterion1992-09-27Paper
Topics of polyhedral combinatorics in transportation problems with exclusions1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39901631992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39852971992-06-27Paper
Polyhedral aspects of multi-index axial transportation problems1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q33624031992-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33624021992-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33637241991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q31976191990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34765971990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57491461990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38160901989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38028931988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37639141987-01-01Paper
Solvability of transportation problems with exclusions1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30267481986-01-01Paper
A proof of the maximal diameter conjecture for the transportation polyhedron1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37193931985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36923801985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36735771984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32179461984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36917111984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37354641984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36822301983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33152751983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33185401983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36683021983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36648291982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36735761981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33185391981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36683001981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39293991981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36648311980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32066561979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32066571979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38519811979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30485731978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41525541978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41731881978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38706661977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41588521977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41904301977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41787761976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41312521976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40854881976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41094901976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41094911976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41369241976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41430131976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40770721975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56717821973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47671161973-01-01Paper

Research outcomes over time

This page was built for person: M. K. Kravtsov