Validation of subgradient optimization
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3282977 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- scientific article; zbMATH DE number 3363340 (Why is no real title available?)
- scientific article; zbMATH DE number 3400685 (Why is no real title available?)
- scientific article; zbMATH DE number 3078983 (Why is no real title available?)
- A Dynamic Programming Approach to Sequencing Problems
- An iterative method, having linear rate of convergence, for solving a pair of dual linear programs
- Constructive Duality in Integer Programming
- Convex Analysis
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Steepest Ascent for Large Scale Linear Programs
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II
Cited in
(only showing first 100 items - show all)- Locating concentrators in centralized computer networks
- On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint
- The computation of Cournot-Nash equilibria for the time-definite freight delivery industry under an oligopolistic market
- Multicommodity network flows: A survey. II: Solution methods
- Complexity estimation for an algorithm of searching for zero of a piecewise linear convex function
- A computational evaluation of two subgradient search methods
- Using integer programming techniques for the solution of an experimental design problem
- A set covering reformulation of the pure fixed charge transportation problem
- Planning online advertising using Gini indices
- A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions
- Projections onto order simplexes
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning
- A constrained nonlinear 0-1 program for data allocation
- Minimal spanning trees with a constraint on the number of leaves
- Calculating surrogate constraints
- IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- Multi-level multi-item lot size planning with limited resources and general manufacturing structure.
- A multiperiod min-sum arborescence problem
- Symmetric weight constrained traveling salesman problem: Local search
- A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Variable fixing method by weighted average for the continuous quadratic knapsack problem
- Linear programming and Lagrangian relaxation heuristics for designing a material flow network on a block layout
- Capacity analysis in repetitive assemble-to-order manufacturing systems
- Exact makespan minimization of unrelated parallel machines
- An efficient Lagrangian-based heuristic to solve a multi-objective sustainable supply chain problem
- Algorithms for the solution of stochastic dynamic minimax problems
- Lower and upper bounds for a two-level hierarchical location problem in computer networks
- An improved subgradient method for constrained nondifferentiable optimization
- Stochastic facility location with general long-run costs and convex short-run costs
- Bounds for the single source modular capacitated plant location problem
- Performance evaluation for a transportation system in stochastic case
- New ideas in Lagrangian relaxation for a scheduling problem with the weighted tardiness criterion
- Diversification through candidate sampling for a non-iterated Lin-Kernighan-Helsgaun algorithm
- The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation
- New Lagrangian relaxation based algorithm for resource scheduling with homogeneous subproblems
- New bundle methods for solving Lagrangian relaxation dual problems
- A hierarchical approach for metal parts fabrication
- Auction-based distributed scheduling in a dynamic job shop environment
- A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs
- The Newton bracketing method for convex minimization: convergence analysis
- A new Lagrangian relaxation approach to the generalized assignment problem
- A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization
- A due date assignment algorithm for multiproduct manufacturing facilities
- Optimal regularized hypothesis testing in statistical inverse problems
- Large-scale mixed integer programming: Benders-type heuristics
- A monotonic, dual-based bounding procedure for integer programs
- A polynomially bounded algorithm for a singly constrained quadratic program
- Alternate solution approaches for competitive hub location problems
- Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
- A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization
- Mixed-integer bilinear programming problems
- A Lagrangian relaxation approach to the edge-weighted clique problem
- Feasible Sequential Decisions and a Flexible Lagrangean‐Based Heuristic for Dynamic Multi‐Level Lot Sizing
- Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
- Solving a multi-resolution model of the train platforming problem using Lagrangian relaxation with dynamic multiplier aggregation
- Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT)
- An integrated disaster preparedness model for retrofitting and relief item transportation
- Mixed-model moving assembly line material placement optimization for a shorter time-dependent worker walking time
- Optimal partitioning of a data set based on the \(p\)-median model
- Benefit sharing in holding situations
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
- The return plant location problem: Modelling and resolution
- A generalization of Polyak's convergence result for subgradient optimization
- Primary and secondary route selection in backbone communication networks
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
- Application of Lagrangian relaxation to computer network control
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
- Solving the swath segment selection problem through Lagrangean relaxation
- Four solution techniques for a general one machine scheduling problem. A comparative study
- Efficient projection algorithms onto the weighted \(\ell_1\) ball
- Approximate solutions to large scale capacitated facility location problems
- On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
- Traffic engineering of tunnel-based networks with class specific diversity requirements
- Note on a method of conjugate subgradients for minimizing nondifferentiable functions
- Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
- A hybrid algorithm for solving network flow problems with side constraints.
- A modified subgradient algorithm for Lagrangean relaxation
- Optimal prioritized channel allocation in cellular mobile systems
- A filtered bucket-clustering method for projection onto the simplex and the \(\ell_1\) ball
- A tree search algorithm for the p-median problem
- A branch-and-bound algorithm for concave network flow problems
- Future paths for integer programming and links to artificial intelligence
- Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems
- Layering strategies for creating exploitable structure in linear and integer programs
- A classification of formulations for the (time-dependent) traveling salesman problem
- A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over
- Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs.
- An algorithm to generate all upper boundary points for \((\mathbf d,B) \) in terms of minimal cuts
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- Statistical performance of subgradient step-size update rules in Lagrangian relaxations of chance-constrained optimization models
- Decomposition methods for the two-stage stochastic Steiner tree problem
- On solving the quadratic shortest path problem
- Lagrangean relaxation heuristics for the \(p\)-cable-trench problem
- A surrogate heuristic for set covering problems
- A method for the cutting stock problem with different qualities
- A two-commodity multistate flow network with capacity weight varying with edges, nodes and types of commodity
This page was built for publication: Validation of subgradient optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4770776)
