Validation of subgradient optimization
From MaRDI portal
Cites work
- 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
- 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?)
- 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)- Two ``well-known properties of subgradient optimization
- The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs
- A computational evaluation of a general branch-and-price framework for capacitated network location problems
- A Lagrangian relaxation approach to large-scale flow interception problems
- Cut generation for an employee timetabling problem
- Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
- A comparison of two dual-based procedures for solving the p-median problem
- A tree search algorithm for the multi-commodity location problem
- A note on solving large p-median problems
- Zero-one integer programs with few contraints - lower bounding theory
- Projections onto order simplexes
- Reoptimization procedures for bounded variable primal simplex network algorithms
- A partial dual algorithm for the capacitated warehouse location problem
- 'Multidimensional' extensions and a nested dual approach for the m-median problem
- The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
- An integer programming model for the allocation of databases in a distributed computer system
- Lagrangean relaxation and decomposition in an uncapacitated 2-hierarchal location-allocation problem
- Efficient algorithms for the capacitated concentrator location problem
- A new Lagrangian relaxation approach to the generalized assignment problem
- A computational evaluation of two subgradient search methods
- Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
- Layering strategies for creating exploitable structure in linear and integer programs
- Application of Lagrangian relaxation to computer network control
- A structural Lagrangean relaxation for two-duty period bus driver scheduling problems
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
- A constrained Steiner tree problem
- Assignment of tools to machines in a flexible manufacturing system
- Solution of a tinned iron purchasing problem by Lagrangean relaxation
- Minmax combinatorial optimization
- A multicriteria approach to the location of public facilities
- Set partitioning mit linearen Randbedingungen
- On the choice of step size in subgradient optimization
- A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
- A tree search algorithm for the p-median problem
- A heuristic decomposition approach to optimal control in a water supply model
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- On the quadratic assignment problem
- Variable target value subgradient method
- The hierarchical network design problem with transshipment facilities
- New overlapping coordination methodologies for large-scale optimization problems
- Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
- Exchanges procedures for timetabling problems
- The \(K\)-coverage concentrator location problem
- A Langrangean heuristic for the \(p_ k\)-median dynamic location problem
- On the continuous quadratic knapsack problem
- Integrating facility layout with process selection and capacity planning
- Configuration of fully replicated distributed database system over wide area networks
- Locating concentrators in centralized computer networks
- The multicovering problem
- A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions
- Four solution techniques for a general one machine scheduling problem. A comparative study
- Some numerical methods for limit analysis in continuum mechanics
- An interactive method as an aid in solving multi-objective mathematical programming problems
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem
- A due date assignment algorithm for multiproduct manufacturing facilities
- Conditional subgradient optimization -- theory and applications
- Primary and secondary route selection in backbone communication networks
- Multicommodity flow models for spanning trees with hop constraints
- Single machine earliness and tardiness scheduling
- A Lagrangean heuristic for the facility location problem with staircase costs
- Mean value cross decomposition applied to integer programming problems
- Plant location with minimum inventory
- Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
- A constrained nonlinear 0-1 program for data allocation
- Estimating the Held-Karp lower bound for the geometric TSP
- Semi-obnoxious location models: A global optimization approach
- Minimal spanning trees with a constraint on the number of leaves
- The return plant location problem: Modelling and resolution
- Designing reliable tree networks with two cable technologies
- A simplicial decomposition method for the transit equilibrium assignment problem
- Application of the scenario aggregation approach to a two-stage, stochastic, common component, inventory problem with a budget constraint
- A technique for speeding up the solution of the Lagrangean dual
- Inexact subgradient methods with applications in stochastic programming
- Experiments with parallel branch-and-bound algorithms for the set covering problem
- An improved subgradient method for constrained nondifferentiable optimization
- Scheduling identical parallel machines to minimize total weighted completion time
- A set covering reformulation of the pure fixed charge transportation problem
- Analyzing tradeoffs between zonal constraints and accessibility in facility location
- Studying the effects of production loss due to setup in dynamic production scheduling
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- Topological design of a centralized communication network with unreliable links and node outage costs
- On using approximations of the Benders master problem
- Solving a class of network models for dynamic flow control
- Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
- Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem
- A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
- Capacity analysis in repetitive assemble-to-order manufacturing systems
- Maximizing the value of a space mission
- Constrained multi-project planning problems: A Lagrangean decomposition approach
- A Lagrangean decomposition solution to a single line multiproduct scheduling problem
- A surrogate heuristic for set covering problems
- A quadratic integer programming method for minimizing the mean squared deviation of completion times
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- On some difficult linear programs coming from set partitioning
- Sample-path optimization of convex stochastic performance functions
- Channel allocation in cellular radio networks
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)
