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)- Two-direction subgradient method for non-differentiable optimization problems
- Variable target value subgradient method
- Solution of a tinned iron purchasing problem by Lagrangean relaxation
- A Lagrangian based heuristic for the design of multipoint linkages in a communication network with unreliable links and node outage costs.
- A Lagrangian approach for minimum cost single round robin tournaments
- Single machine scheduling with symmetric earliness and tardiness penalties
- Models for a traveling purchaser problem with additional side-constraints
- Conditional subgradient optimization -- theory and applications
- Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization
- Modeling formulation and a new heuristic for the railroad blocking problem
- Fast projection onto the simplex and the l₁ ball
- Computing assortative mixing by degree with the s-metric in networks using linear programming
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- A dual algorithm for the one-machine scheduling problem
- Designing reliable tree networks with two cable technologies
- On and Beyond Total Variation Regularization in Imaging: The Role of Space Variance
- Solving network manpower problems with side constraints
- Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem
- Multiple machine continuous setup lotsizing with sequence-dependent setups
- A globally convergent method for solving a quartic generalized Markowitz portfolio problem
- Solving a class of network models for dynamic flow control
- Heuristic algorithms for dynamic capacitated lotsizing for production flow networks with setup times
- A multiperiod degree constrained minimal spanning tree problem
- Planning capacity and safety stocks in a serial production-distribution system with multiple products
- About Lagrangian methods in integer optimization
- A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem
- System capacity for a two-commodity multistate flow network with unreliable nodes and capacity weight
- Spectral projected subgradient with a momentum term for the Lagrangean dual approach
- Lagrangian heuristics for the quadratic knapsack problem
- A multiperiod planning model for the capacitated minimal spanning tree problem
- Multi-item spare parts systems with lateral transshipments and waiting time constraints
- Set partitioning mit linearen Randbedingungen
- Integrated production and logistics planning: contract manufacturing and choice of air/surface transportation
- On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering
- Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items
- Finding minimum and equitable risk routes for hazmat shipments
- The traveling salesman problem: A duality approach
- Affinity propagation and uncapacitated facility location problems
- Solving large-scale profit maximization capacitated lot-size problems by heuristic methods
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
- Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses
- A simplicial decomposition method for the transit equilibrium assignment problem
- Flexible solutions to maritime inventory routing problems with delivery time windows
- Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
- Truck synchronization at single door cross-docking terminals
- Topological design of a centralized communication network with unreliable links and node outage costs
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- Determinantal point processes for image processing
- Accelerating the convergence of subgradient optimisation
- Lagrangean relaxation and decomposition in an uncapacitated 2-hierarchal location-allocation problem
- A two-item two-warehouse periodic review inventory model with transshipment
- Inexact subgradient methods with applications in stochastic programming
- Efficient algorithms for the capacitated concentrator location problem
- Metaheuristic-based Lagrangian relaxation for total weighted tardiness minimization
- Generate upper boundary vectors meeting the demand and budget for a \(p\)-commodity network with unreliable nodes
- A Lagrangian relaxation approach to solving the integrated pick-up/drop-off point and AGV flowpath design problem
- A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
- Enhanced models and improved solution for competitive biofuel supply chain design under land use constraints
- Two fast algorithms for projecting a point onto the canonical simplex
- Generalized route planning model for hazardous material transportation with VaR and equity considerations
- Incorporating location, inventory and price decisions into a supply chain distribution network design problem
- A Newton's method for the continuous quadratic knapsack problem
- Cluster Lagrangean decomposition in multistage stochastic optimization
- On the quadratic assignment problem
- Mean value cross decomposition applied to integer programming problems
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- Constrained multi-project planning problems: A Lagrangean decomposition approach
- Variable fixing algorithms for the continuous quadratic Knapsack problem
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
- Dynamic bundle methods
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
- Combinatorial heuristics for inventory routing problems
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
- Equitable routing of rail hazardous materials shipments using CVaR methodology
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Analyzing tradeoffs between zonal constraints and accessibility in facility location
- Lagrangean/surrogate relaxation for generalized assignment problems
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
- Channel allocation in cellular radio networks
- Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop
- An efficient lagrangean relaxation scheme for linear and integer equal flow problems
- Capacitated disassembly scheduling with random demand
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- Solving capacitated clustering problems
- Estimating the Held-Karp lower bound for the geometric TSP
- Heuristically guided algorithm for k-parity matroid problems
- A Lagrangian relaxation approach to large-scale flow interception problems
- Ein Subgradientenverfahren zur Klassifikation qualitativer Daten
- The p-Lagrangian relaxation for separable nonconvex MIQCQP problems
- Routing and capacity assignment in backbone communication networks
- Convergence and computational analyses for some variable target value and subgradient deflection methods
- A Benders decomposition based heuristic for the hierarchical production planning problem
- A heuristic decomposition approach to optimal control in a water supply model
- Exchanges procedures for timetabling problems
- Zone pricing for time-definite LTL freight transportation with elastic demand
- Heuristics for the multi-item capacitated lot-sizing problem with lost sales
- Optimizing production capacity and safety stocks in general acyclic supply chains
- Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem
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)
