The following pages link to I. Litvinchev (Q1304490):
Displaying 50 items.
- (Q227108) (redirect page) (← links)
- Multiperiod optimal planning of thermal generation using cross decomposition (Q353701) (← links)
- (Q384669) (redirect page) (← links)
- A MILP bi-objective model for static portfolio selection of R\&D projects with synergies (Q384673) (← links)
- Packing circular-like objects in a rectangular container (Q499146) (← links)
- Lagrangian heuristic for a class of the generalized assignment problems (Q611434) (← links)
- An interactive algorithm for portfolio bi-criteria optimization of R\&D projects in public organizations (Q733911) (← links)
- An integrated mathematical-computer approach for R\&D project selection in large public organisations (Q843414) (← links)
- Using error bounds to compare aggregated generalized transportation models (Q863575) (← links)
- A Lagrangian bound for many-to-many assignment problems (Q975754) (← links)
- Iterative aggregation method for constrained optimal control problems (Q1196834) (← links)
- Localization of the optimal solution and a posteriori bounds for aggregation (Q1304491) (← links)
- Bounds on the suboptimalization of aggregation in convex programming (Q1324010) (← links)
- Aggregation in large-scale optimization (Q1412415) (← links)
- On improved Choi-Goldfarb solution-containing ellipsoids in linear programming (Q1591595) (← links)
- Integrating territory design and routing problems (Q1647415) (← links)
- Integer programming formulations for approximate packing circles in a rectangular container (Q1718120) (← links)
- Selecting large portfolios of social projects in public organizations (Q1718890) (← links)
- Iterative aggregation and decomposition in block-separable extremum problems (Q1802611) (← links)
- A two-level decomposition-aggregation approach for large-scale optimal control problems (Q1903655) (← links)
- The use of lower bounds in minimization by the interior-point method (Q1903920) (← links)
- Optimized packing multidimensional hyperspheres: a unified approach (Q1979535) (← links)
- Large scale portfolio selection with synergies (Q2017642) (← links)
- Sparsest balanced packing of irregular 3D objects in a cylindrical container (Q2029950) (← links)
- Optimized filling of a given cuboid with spherical powders for additive manufacturing (Q2059194) (← links)
- Packing ellipsoids in an optimized cylinder (Q2183847) (← links)
- State constraints in optimal impulsive controls (Q2381885) (← links)
- Calculating the best dual bound for problems with multiple Lagrangian relaxations (Q2391512) (← links)
- Aggregation-based decomposition for multi-divisional models (Q2566342) (← links)
- Aggregation in the generalized transportation problem (Q2567655) (← links)
- Packing convex polygons in minimum-perimeter convex hulls (Q2679237) (← links)
- Chaotic simulator for bilevel optimization of virtual machine placements in cloud computing (Q2683378) (← links)
- An investigation of multi-dimensional control problems for heat conduction (Q2733245) (← links)
- Large-dimensional control problems with cross connections. I: Examples of formulations (Q2733399) (← links)
- A priori error bounds for the aggregation in the generalized transportation problem (Q2771310) (← links)
- Decomposition in dynamic problems with cross connections. Part 2. (Q2785538) (← links)
- Decomposition in dynamic problems with cross connections. Part 1. (Q2785540) (← links)
- (Q3031524) (← links)
- (Q3202894) (← links)
- Iterative aggregation in linearly quadratic control problems with cross couplings (Q3211881) (← links)
- Decomposition-aggregation method for convex programming problems (Q3352850) (← links)
- (Q3360083) (← links)
- (Q3468843) (← links)
- (Q3476594) (← links)
- (Q3496156) (← links)
- Comparison of Lagrangian bounds for one class of generalized assignment problems (Q3545175) (← links)
- (Q3573425) (← links)
- (Q3657784) (← links)
- (Q3698634) (← links)
- (Q3783530) (← links)
