Section of discrete optimization

• A. A. Andrianova, T. M. Mukhtarova, V. R. Fazylov
MODEL SHEET RECTANGULAR PACKING PROBLEM
• M. V. Batsyn, A. A. Ponomarenko
HEURISTIC FOR THE TRUCK AND TRAILER ROUTING PROBLEM
• E. A. Bobrova, V. V. Servakh
CONSTRUCTION OF CYCLIC SCHEDULING WITH DUPLICATED MACHINES
• N. I. Burlakova, I. A. Polantseva, V. V. Servakh
PROCUREMENT OPTIMIZATION WITH POSSIBILITY OF ALTERNATIVE USE OF CAPITAL
• V. V. Bykova
THE OPTIMAL SEGMENTATION OF GRAPH
• I. A. Davydov
EXPERIMENTAL STUDY OF AN EXPONENTIAL NEIGHBORHOOD FOR THE SERVERS LOAD BALANCING PROBLEM
• I. A. Davydov, A. A. Melnikov, A. A. Panin
METAHEURISTICS FOR THE SERVERS LOAD BALANCING PROBLEM
• A. Dudchenko, A. Lazarev
APPROACHES TO SOLUTION UNIVERSITY TIMETABLING
• V. A. Emelichev, E. V. Ustilko
POST-OPTIMAL ANALYSIS OF A VECTOR BOOLEAN PORTFOLIO OPTIMISATION PROBLEM WITH EXTREME OPTIMISM CRITERIA
• A. V. Eremeev, J. V. Kovalenko
ON PROJECT SCHEDULING PROBLEM WITH CHANGING CONSUMPTION AND SUPPLY RATES OF RENEWABLE RESOURCES
• A. I. Erzin
MINIMIZING THE NUMBER OF EQUAL SECTOR IN REGULAR COVERING OF THE PLANE
• E. Kh. Gimadi
ALGORITHMS WITH PERFORMANCE GUARANTEES FOR SOME HARD PROBLEMS ON GRAPHS
• E. Kh. Gimadi, D. Chesnokov, E. Shin
ABOUT ONE CLASS OF CLUSTERISATION PROBLEMS ON THE NETWORK GRAPH
• E. Kh. Gimadi, A. M. Istomin, I. A.Rykov
ON 2-CAPACITATED PERIPATETIC SALESMAN PROBLEM
• E. Kh. Gimadi, A. V. Kel'manov, A. V. Pyatkin, M. Yu. Khachai
EFFICIENT ALGORITHMS WITH PERFORMANCE GUARANTEES FOR SOME PROBLEMS OF FINDING SEVERAL CLIQUES IN A WEIGHTED COMPLETE UNDIRECTED GRAPH
• E. Kh. Gimadi, O. Yu. Tsidulko
ON THE ASYMPTOTIC OPTIMALITY OF SOLVING THE MAXIMUM-WEIGHT m-PERIPATETIC SALESMAN PROBLEM
• E. Goncharov
LOWER BOUND PROCEDURE IN THE BRANCH AND BOUND METHOD FOR THE SCHEDULING PROBLEM WITH RESTRICTED RESOURCES
• Oleg Iemets, Oleksandra Yemets`
ABOUT THE BRANCH AND BOUND METHOD IN OPTIMIZATION PROBLEMS WITH INTERVAL UNCERTAINTY
• G. Iofina, A. Minaev, Yu. Polyakov, Yu. Maximov
METRIC OPTIMIZATION IN SEMISUPERVISED LEARNING PROBLEMS
• V. M. Kartak, A. V. Ripatti
CONSTRUCTION FACTOR - SETS FOR THE ONE DIMENSIONAL PACKAGING STOCK PROBLEM
• E. A. Kazakovtseva, V. V. Servakh
HE NP-HARD PROJECT MANAGEMENT PROBLEM WITH CREDITS
• A. Kel'manov, S. Khamidullin
AN APPROXIMATION POLYNOMIAL ALGORITHM FOR A PROBLEM OF A SEQUENCE BI-PARTITIONING
• A. Kel'manov, V. Khandeev
AN EXACT PSEUDOPOLYNOMIAL ALGORITHM FOR A TWO-CLUSTER PARTITIONING PROBLEM
• M. Khachay, E. Neznakhina
OLYNOMIAL TIME APPROXIMATION SCHEMES FOR SOME GENERALIZATIONS OF EUCLIDEAN TRAVELING SALESMAN PROBLEM
• A. Khmelev
A LOCAL SEARCH ALGORITHM FOR THE HETEROGENEOUS VEHICLE ROUTING PROBLEM
• K. S. Kobylkin
APPROXIMATION ALGORITHMS FOR NP-HARD POLYHEDRAL SEPARABILITY PROBLEMS
• A. Kononov
APPROXIMATION ALGORITHMS FOR ENERGY EFFICIENT SCHEDULING
• A. V. Kononov, V. P. Il'ev, S. D. Il'eva
GRAPH APPROXIMATION PROBLEMS (CORRELATION CLUSTERING)
• P. Kononova
COMPUTER-AIDED WAY TO PROVE THEOREMS IN SCHEDULING MULTIPROCESSOR JOBS
• Yu. Kochetov, I. Sokolova
LOCAL SEARCH ALGORITHM FOR THE BI-LEVEL FACILITY LOCATION AND DESIGN PROBLEM
• N. A. Kochetova
AN LP-BASED HEURISTIC FOR THE SERVERS LOAD BALANCING PROBLEM
• I. V. Kozin, G. L. Kozina
EVOLUTIONARY MODELS of DISCRETE OPTIMIZATION PROBLEMS BASED on FRAGMENTARY STRUCTURES
• S. M. Lavlinsky
BILEVEL MATHEMATICAL PROGRAMMING PROBLEMS AND TOOLS FOR DEVELOPMENT OF RAW MATERIAL BASE
• A. Lazarev
Methods of the solution of railway scheduling problems
• A. Lazarev, N. Khusnullin
Optimal schedule for repair a double-track railroad
• T. V. Levanova, E. A. Borisevich, O. A. Dubovik
APPLICATION OF SOME SWARM ALGORITHMS FOR SOLVING FACILITY LOCATION PROBLEM WITH FLEXIBLE DEMAND
• S. A. Malakh, V. V. Servakh
OPTIMISATION OF BORROWER'S RISK ON MORTGAGE LOAN
• Yu. Maximov
REINFORCEMENT SEMIDEFINITE RELAXATIONS FOR SOME NP-HARD COMBINATORIAL OPTIMIZATION PROBLEMS
• A. V. Melnichenko
AN APPROXIMATION ALGORITHMS FOR THE TWO-MACHINE ROUTING OPEN SHOP PROBLEM
• Yu. A. Mesentsev
THE BINARY CUTTING METHOD FOR SOLVING LINEAR PROGRAMMING PROBLEMS WITH BOOLEAN VARIABLES
• A. Panin
METAHEURISTICS FOR THE FACILITY LOCATION AND PRICING PROBLEM
• R. V. Plotnikov
HYBRID GENETIC ALGORITHM FOR THE OPTIMAL SYNTHESIS OF COMMUNICATION NETWORK
• N. I. Plyaskina
OPTIMAL ALLOCATION OF RESOURCES BETWEEN THE NETWORK PROJECT (BY THE EXAMPLE OF PIPELINES CONSTRUCTION)
• A. V. Plyasunov
BILEVEL PLANNING MODELS OF PUBLIC PRIVATE PARTNERSHIP
• A. Ponomarenko
Decentralized Scalable Algorithm for Approximate Nearest Neighbor Search
• A. V. Prolubnikov
THE REFINEMENT OF THE SOLUTIOIN ESTIMATION FOR AN INDIVIDUAL SET COVER PROBLEM
• A. V. Pyatkin
ON INTERVAL (1,1)-COLORING OF INCIDENTORS
• A. B. Ramazanov
THE ANALYSIS OF STABILITY OF GRADIENT ALGORITHM FOR PROBLEMS OF CONVEX DISCRETE OPTIMIZATION
• E. O. Rapoport
About a problem of controlling a random walk on integer points plane
• A. V. Ripatti, V. M. Kartak
EQUIVALENT TRANSFORMATIONS IN ORTHOGONAL PACKING PROBLEM
• S. Romanchenko
A few algorithms for some quadratic Euclidean problems of choosing vector subset and subsequence
• A. A. Romanova
ALGORITHMS FOR SOME BATCHING SCHEDULING PROBLEMS WITH BOUNDED SIZE OF BATCHES
• R. Y. Simanchev, I. V. Urazova
THE POLYTOPE OF THE GRAPH APPROXIMATION PROBLEM
• R. Shangin, P. Pardalos, A. Panyukov
HEURISTICS FOR MINIMUM SPANNING K-TREE PROBLEM
• N. Yu. Shereshik
POLYHEDRAL PROPERTIES OF THE PROBLEM OF INTERRUPT-ORIENTED SERVICES OF JOBS BY SINGLE MACHINE
• O. N. Shulgina
Some approximate algorithms for NP-complete problem of sequencing
• A. F. Valeeva, Y. A. Goncharova, I. S. Koshcheev
ABOUT RESEARCH AND SOLVING THREE-DIMENSIONAL EXTENDED VEHICLE ROUTING PROBLEM
• I. Vasilyev, A. Ushakov
ON AN APPROACH TO FINDING ROBUST SOLUTIONS TO DISCRETE LOCATION PROBLEMS
• L. I. Vasilyeva, A. Ahtyamov
PACKING METHODS OF N-DIMENSIONAL ORTHOGONAL POLYHEDRAL
• G. G. Zabudsky, N. S. Veremchuk
SOLVING OF MINIMAX WEBER PROBLEM IN A PLANE WITH FORBIDDEN GAPS
• L. A. Zaozerskaya
EXPERIMENTAL ANALYSIS OF SOME CLASS OF SET PACKING PROBLEMS
• A. V. Zinoviev
METHODS OF APPROXIMATE SOLUTION SEARCHING FOR A SHORTEST PATH PROBLEM IN A LARGE GRAPH
• V. S. Zykin
CONSTRUCTION OF A MINIMAL COVERING OF INCLUSION DEPENDENCES