On a problem by M. Kazarian

被引：0
作者：
Vassiliev, VA [1 ]
机构：
[1] VA Steklov Math Inst, Moscow 117333, Russia
来源：
FUNCTIONAL ANALYSIS AND ITS APPLICATIONS | 1999年 / 33卷 / 03期
基金：
俄罗斯基础研究基金会;
关键词：
Convex Hull; Compact Subgroup; Function Germ; Equation Alal; Equivariant Homology;
D O I：
10.1007/BF02465206
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
[No abstract available]
引用
收藏
页码：220 / 221
页数：2
相关论文
共 50 条
[31]   CONVEX HULL PROBLEM, LATTICE POINTS AND APPLICATIONS [J].
Fanache, Dumitru .
JOURNAL OF SCIENCE AND ARTS, 2011, (02) :163-175
[32]   A simple algorithm for solving travelling salesman problem [J].
An Kai ;
Xing Mingrui .
PROCEEDINGS OF THE 2012 SECOND INTERNATIONAL CONFERENCE ON INSTRUMENTATION & MEASUREMENT, COMPUTER, COMMUNICATION AND CONTROL (IMCCC 2012), 2012, :931-935
[33]   A polynomial algorithm for one problem of guillotine cutting [J].
Arslanov, M. Z. .
OPERATIONS RESEARCH LETTERS, 2007, 35 (05) :636-644
[34]   Complex problem solving: another test case? [J].
Ragni, Marco ;
Loeffler, Christoph M. .
COGNITIVE PROCESSING, 2010, 11 (02) :159-170
[35]   Analyzing Valid Inequalities of the Generation Unit Commitment Problem [J].
Hedman, Kory W. ;
O'Neill, Richard P. ;
Oren, Shmuel S. .
2009 IEEE/PES POWER SYSTEMS CONFERENCE AND EXPOSITION, VOLS 1-3, 2009, :1737-1742
[36]   On a maximization problem for the convex hull of connected systems of segments [J].
Gori, Michele .
JOURNAL OF CONVEX ANALYSIS, 2007, 14 (01) :49-68
[37]   A simple and efficient preprocessing step for convex hull problem [J].
Heydari, Mohammad ;
Khalifeh, Ashkan ;
Rathour, Laxmi .
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2024, 16 (07)
[38]   Discrete probability distributions and moment problem: numerical aspects [J].
Tagliani, A .
APPLIED MATHEMATICS AND COMPUTATION, 2001, 119 (01) :47-56
[39]   On formulations of the stochastic uncapacitated lot-sizing problem [J].
Guan, YP ;
Ahmed, S ;
Miller, AJ ;
Nemhauser, GL .
OPERATIONS RESEARCH LETTERS, 2006, 34 (03) :241-250
[40]   An efficient algorithm for the three-dimensional diameter problem [J].
S. Bespamyatnikh .
Discrete & Computational Geometry, 2001, 25 :235-255
12345