scientific article; zbMATH DE number 3679539
zbMATH Open0435.90064MaRDI QIDQ3875693FDOQ3875693
Authors: T. T. Lebedeva, V. A. Roshchin, I. V. Sergienko 
Publication date: 1980
Title of this publication is not available (Why is that?)
surveyknapsack problemnumerical studyboolean programmingbranch and bound methodsparametric integer linear programmingcomparison of algorithmsimplementation of algorithmsprogram systemscomputer organizationblock-diagonal matricessoftware organizationfall-vector methodintegral programmingaccelerated additive algorithmChervak's method of small treesdirecting neighbourhoods methodlocal-stochastic algorithmsmanaged random searchpractical data processing problems
Numerical mathematical programming methods (65K05) Data structures (68P05) Specification and verification (program logics, model checking, etc.) (68Q60) Boolean programming (90C09) Theory of operating systems (68N25)
Cited In (22)
- Title not available (Why is that?)
- Effectiveness of the local algorithm for the solution of one class of discrete programming problems
- Title not available (Why is that?)
- Fast solution of discretized optimization problems. Workshop held at the Weierstrass Institute for Applied Analysis and Stochastics, Berlin, Germany, May 8--12, 2000
- Certain parametric problems of integer convex programming and their approximate solution
- Main directions in the development of informatics
- Mathematical models for arbitrage planning
- Formalization and solution of a special class of transportation problems
- Some directions and results of research in mathematical programming and system analysis
- Title not available (Why is that?)
- Method of solution of extremal combinatorial problems with nonlinear structure
- Solution of a parametric integer programming problem
- Solving partially integer-valued optimization problems which are convex relative to a continuous variable
- Proving the convergence of the iterative method for solving a game-type combinatorial optimization problem on arrangements
- Stability, parametric, and postoptimality analysis of discrete optimization problems
- New applications of partial orders
- Investigation of optimization methods and their applications
- Solution of one problem of optimal partition of the vertex set of a hypergraph
- An approach to the construction of approximate solutions of Boolean linear programming problems
- APROS: Algorithmic Development Methodology for Discrete-Continuous Optimization Problems
- Problems of discrete optimization: challenges and main approaches to solve them
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3875693)
