Decomposition techniques in mathematical programming. Engineering and science applications.
From MaRDI portal
Publication:3377692
zbMATH Open1186.90002MaRDI QIDQ3377692FDOQ3377692
Authors: Antonio J. Conejo, R. Mínguez, Enrique Castillo, R. García-Bertrand 
Publication date: 28 March 2006
Recommendations
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Physics, astronomy, technology, engineering (aspects of mathematics education) (97M50) Mathematical programming (90Cxx) Mathematical programming (educational aspects) (97N60)
Cited In (59)
- A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
- Analysis of stochastic problem decomposition algorithms in computational grids
- Combined regression models
- Title not available (Why is that?)
- DeCODe: a community-based algorithm for generating high-quality decompositions of optimization problems
- Chebyshev differential quadrature for numerical solutions of third- and fourth-order singular perturbation problems
- Optimal engineering design via Benders' decomposition
- A scalable solution framework for stochastic transmission and generation planning problems
- Exact penalties for decomposable convex optimization problems
- Railway disruption management: designing bus bridging services under uncertainty
- Sensitivity analysis in ordered and restricted parameter models
- Service location grouping and pricing in transportation: application in air cargo
- An efficient algorithm for state estimation problems with coupling inequality constraints
- A feasibility-ensured Lagrangian heuristic for general decomposable problems
- A multi-stage stochastic program for supply chain network redesign problem with price-dependent uncertain demands
- A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints
- Constraint generation for risk averse two-stage stochastic programs
- Duality and local sensitivity analysis in least squares, minimax, and least absolute values regressions
- Heat and electricity market coordination: a scalable complementarity approach
- Risk optimization with \(p\)-order conic constraints: a linear programming approach
- An ordinal optimization theory-based algorithm for large distributed power systems
- Mathematical programming approaches for classes of random network problems
- A robust optimization approach to energy and reserve dispatch in electricity markets
- Dantzig-Wolfe and block coordinate-descent decomposition in large-scale integrated refinery-planning
- Improving parameter estimation using constrained optimization methods
- An inexact interior-point Lagrangian decomposition algorithm with inexact oracles
- On parallelization of a stochastic dynamic programming algorithm for solving large-scale mixed \(0-1\) problems under uncertainty
- Robust transmission network expansion planning in energy systems: improving computational performance
- An exact decomposition algorithm for the generalized knapsack sharing problem
- A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints
- Timetabling optimization of a mixed double- and single-tracked railway network
- Two bounds for integrating the virtual dynamic cellular manufacturing problem into supply chain management
- A continuous bi-level model for the expansion of highway networks
- Master problem approximations in Dantzig-Wolfe decomposition of variational inequality problems with applications to two energy market models
- An Exponential Model for Damage Accumulation
- Discussion on: ``A decomposition algorithm for KYP-SDPs
- Timetabling optimization of a single railway track line with sensitivity analysis
- AAR-based decomposition algorithm for non-linear convex optimisation
- Futures Market Trading for Electricity Producers and Retailers
- A heuristic block coordinate descent approach for controlled tabular adjustment
- A decomposition approach to the two-stage stochastic unit commitment problem
- Risk‐averse optimization and resilient network flows
- A complementarity model for electric power transmission-distribution coordination under uncertainty
- Estimating the parameters of a fatigue model using Benders' decomposition
- A unitary distributed subgradient method for multi-agent optimization with different coupling sources
- Lagrangian relaxation of the generic materials and operations planning model
- Combinatorial decomposition and industrial applications.
- Diagnostics for non-linear regression
- An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation
- Transmission network investment using incentive regulation: a disjunctive programming approach
- Integer programming techniques for educational timetabling
- Stabilized Benders decomposition for energy planning under climate uncertainty
- High-Performance Prototyping of Decomposition Methods in GAMS
- Robust provision of demand response from thermostatically controllable loads using lagrangian relaxation
- Location of urban micro‐consolidation centers to reduce the social cost of last‐mile deliveries of cargo: A heuristic approach
- Application of decomposition techniques in a wildfire suppression optimization model
- Nested Benders's decomposition of capacity-planning problems for electricity systems with hydroelectric and renewable generation
- An efficient greedy heuristic for the real-time train platforming problem
Uses Software
This page was built for publication: Decomposition techniques in mathematical programming. Engineering and science applications.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3377692)
