Pages that link to "Item:Q5609870"
From MaRDI portal
The following pages link to Elements of Large-Scale Mathematical Programming Part I: Concepts (Q5609870):
Displayed 50 items.
- Solving large-scale linear programs by aggregation (Q581234) (← links)
- Applied unsupervised learning in model reduction of linear dynamic systems (Q679283) (← links)
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (Q686998) (← links)
- Large-scale mixed integer programming: Benders-type heuristics (Q789322) (← links)
- Composite-variable modeling for service parts logistics (Q867536) (← links)
- The linearized version of an algorithm for the mixed norms problem (Q912569) (← links)
- Finiteness in restricted simplicial decomposition (Q1069859) (← links)
- General communication schemes for multiobjective decision making (Q1075941) (← links)
- A large scale timetabling problem (Q1112719) (← links)
- Existence of optimal Lagrange multipliers for certain nonconvex allocation problems (Q1138233) (← links)
- Incentives, iterative communication, and organizational control (Q1141583) (← links)
- Optimal cargo allocation on board a plane: A sequential linear programming approach (Q1152850) (← links)
- Optimality tests for partitioning and sectional search algorithms (Q1178318) (← links)
- Minimization methods with constraints (Q1234628) (← links)
- A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions (Q1240155) (← links)
- Large-scale problem analysis and decomposition theory (Q1252186) (← links)
- Multilevel decomposition of nonlinear programming problems by dynamic programming (Q1253184) (← links)
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality (Q1257414) (← links)
- A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals (Q1296022) (← links)
- Average shadow prices in mathematical programming (Q1321203) (← links)
- Using dual network bounds in algorithms for solving generalized set packing/partitioning problems (Q1814995) (← links)
- A heuristic for the continuous capacity and flow assignment (Q1869661) (← links)
- Stochastic mathematical programs with equilibrium constraints (Q1969762) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- Generalized Benders decomposition (Q2550358) (← links)
- Parametric solution to the joint system identification and optimization problem (Q2560613) (← links)
- A mixed integer programming model for scheduling orders in a steel mill (Q2563111) (← links)
- AN η-APPROXIMATION APPROACH IN NONLINEAR VECTOR OPTIMIZATION WITH UNIVEX FUNCTIONS (Q3421864) (← links)
- Extended VIKOR as a new method for solving Multiple Objective Large-Scale Nonlinear Programming problems (Q3561753) (← links)
- A novel modeling approach for express package carrier planning (Q3627939) (← links)
- An ideal column algorithm for integer programs with special ordered sets of variables (Q3666590) (← links)
- The method of double truncation in the decomposition of large-scale problems (Q3731380) (← links)
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs (Q3757690) (← links)
- Revised dantzig-wolfe decomposition for staircase-structured linear programs (Q3779999) (← links)
- Foundations of hierarchical control (Q3855003) (← links)
- A decomposition algorithm for quadratic programming (Q3870676) (← links)
- Identification of special structure constraints in linear programs (Q3920989) (← links)
- Mixed-integer quadratic programming (Q3931023) (← links)
- A central cutting plane algorithm for the convex programming problem (Q4081013) (← links)
- Lösung großer linearer Regionalplanungsprobleme mit der Methode vonDantzig undWolfe (Q4088625) (← links)
- (Q4133407) (← links)
- Simplicial decomposition in nonlinear programming algorithms (Q4136951) (← links)
- Computational aspects of cutting-plane algorithms for geometric programming problems (Q4149242) (← links)
- Decomposition of arborescent linear programs (Q4156135) (← links)
- An algorithm for a piecewise linear model of trade and production with negative prices and bankruptcy (Q4187536) (← links)
- OPTIMAL ALLOCATION OF TESTING RESOURCE FOR A MODULAR SOFTWARE (Q4650601) (← links)
- Simplicial Decomposition for Convex Generalized Networks (Q4712275) (← links)
- An algorithm for hierarchical optimization of large-scale problems with nested structure (Q4745631) (← links)
- An extension of the frank and Wolfe method of feasible directions (Q4770213) (← links)
- Applications of a general convergence theory for outer approximation algorithms (Q4770226) (← links)