Elements of Large-Scale Mathematical Programming Part I: Concepts
From MaRDI portal
Publication:5609870
Cited in
(73)- Finiteness in restricted simplicial decomposition
- General communication schemes for multiobjective decision making
- A large scale timetabling problem
- Existence of optimal Lagrange multipliers for certain nonconvex allocation problems
- Incentives, iterative communication, and organizational control
- Optimal cargo allocation on board a plane: A sequential linear programming approach
- Optimality tests for partitioning and sectional search algorithms
- Minimization methods with constraints
- A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions
- Large-scale problem analysis and decomposition theory
- Multilevel decomposition of nonlinear programming problems by dynamic programming
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals
- Average shadow prices in mathematical programming
- Heuristics for vehicle routing problems: sequence or set optimization?
- The Benders decomposition algorithm: a literature review
- Using dual network bounds in algorithms for solving generalized set packing/partitioning problems
- A heuristic for the continuous capacity and flow assignment
- Decomposition strategy for the stochastic pooling problem
- Stochastic mathematical programs with equilibrium constraints
- An outer-approximation guided optimization approach for constrained neural network inverse problems
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- An augmented Lagrangian decomposition method for block diagonal linear programming problems
- A survey on the continuous nonlinear resource allocation problem
- Generalized Benders decomposition
- Parametric solution to the joint system identification and optimization problem
- A mixed integer programming model for scheduling orders in a steel mill
- Large-scale optimization with the primal-dual column generation method
- An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- AN η-APPROXIMATION APPROACH IN NONLINEAR VECTOR OPTIMIZATION WITH UNIVEX FUNCTIONS
- Extended VIKOR as a new method for solving multiple objective large-scale nonlinear programming problems
- A novel modeling approach for express package carrier planning
- An ideal column algorithm for integer programs with special ordered sets of variables
- The method of double truncation in the decomposition of large-scale problems
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Revised dantzig-wolfe decomposition for staircase-structured linear programs
- Foundations of hierarchical control
- A decomposition algorithm for quadratic programming
- Identification of special structure constraints in linear programs
- Mixed-integer quadratic programming
- A central cutting plane algorithm for the convex programming problem
- Lösung großer linearer Regionalplanungsprobleme mit der Methode vonDantzig undWolfe
- scientific article; zbMATH DE number 3557522 (Why is no real title available?)
- Simplicial decomposition in nonlinear programming algorithms
- Computational aspects of cutting-plane algorithms for geometric programming problems
- Decomposition of arborescent linear programs
- An algorithm for a piecewise linear model of trade and production with negative prices and bankruptcy
- An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints
- Accelerating the Benders decomposition method: application to stochastic network design problems
- OPTIMAL ALLOCATION OF TESTING RESOURCE FOR A MODULAR SOFTWARE
- Simplicial Decomposition for Convex Generalized Networks
- An algorithm for hierarchical optimization of large-scale problems with nested structure
- An extension of the frank and Wolfe method of feasible directions
- Applications of a general convergence theory for outer approximation algorithms
- Validation of subgradient optimization
- A projective method for structured nonlinear programs
- A partitioning algorithm for the multicommodity network flow problem
- Solving large-scale linear programs by aggregation
- Disjunctive cuts in mixed-integer conic optimization
- A three-phase matheuristic algorithm for the multi-day task assignment problem
- Partitioning procedure for polynomial optimization
- A stochastic programming model for scheduling call centers with global service level agreements
- Multistage system planning for hydrogen production and distribution
- Generalized Benders' decomposition for topology optimization problems
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- A branch-and-cut algorithm for a class of sum-of-ratios problems
- Applied unsupervised learning in model reduction of linear dynamic systems
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
- Robust two-stage optimization consensus models with uncertain costs
- Large-scale mixed integer programming: Benders-type heuristics
- Composite-variable modeling for service parts logistics
- The linearized version of an algorithm for the mixed norms problem
This page was built for publication: Elements of Large-Scale Mathematical Programming Part I: Concepts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5609870)
