scientific article; zbMATH DE number 3557512
From MaRDI portal
Publication:4133397
zbMATH Open0357.90031MaRDI QIDQ4133397FDOQ4133397
Authors: Luigi Fratta, Francesco Maffioli, Paolo M. Camerini 
Publication date: 1975
Title of this publication is not available (Why is that?)
Cited In (83)
- Exact algorithms for the vertex separator problem in graphs
- A computational evaluation of two subgradient search methods
- Nodal aggregation of resource constraints in a shortest path problem
- An improved subgradient method for constrained nondifferentiable optimization
- Orthogonalizing linear operators in convex programming. I, II
- Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling
- A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs
- Primal-dual approach to the single level capacitated lot-sizing problem
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
- Incorporating inventory and routing costs in strategic location models
- Surrogate duality in a branch-and-bound procedure for integer programming
- A modified subgradient algorithm for Lagrangean relaxation
- An algorithm for the planar three-index assignment problem
- A heuristic method for lot-sizing in multi-stage systems
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
- Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
- A network relaxation based enumeration algorithm for set partitioning
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
- Heuristics for capacity planning problems with congestion
- Multifleet routing and multistop flight scheduling for schedule perturbation
- Variable target value subgradient method
- Solution of a tinned iron purchasing problem by Lagrangean relaxation
- Conditional subgradient optimization -- theory and applications
- Ranking arborescences in O(Km log n) time
- About Lagrangian methods in integer optimization
- Optimization of R\&D project portfolios under endogenous uncertainty
- The Min-Max Spanning Tree Problem and some extensions
- Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
- An effective heuristic for large-scale capacitated facility location problems
- Surrogate gradient algorithm for Lagrangian relaxation
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Lagrangean/surrogate relaxation for generalized assignment problems
- Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Heuristically guided algorithm for k-parity matroid problems
- Convergence of a generalized subgradient method for nondifferentiable convex optimization
- Ein Subgradientenverfahren zur Klassifikation qualitativer Daten
- Convergence and computational analyses for some variable target value and subgradient deflection methods
- Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
- Efficient decomposition and linearization methods for the stochastic transportation problem
- Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs
- Lagrangean relaxation. (With comments and rejoinder).
- A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
- Hybrid methods for lot sizing on parallel machines
- Studying the effects of production loss due to setup in dynamic production scheduling
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
- Dual-based heuristics for a hierarchical covering location problem
- Multi-item capacitated lot-sizing by a cross decomposition based algorithm
- The multicovering problem
- Topological design of wide area communication networks
- Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations
- Rescheduling optimization of steelmaking-continuous casting process based on the Lagrangian heuristic algorithm
- On some difficult linear programs coming from set partitioning
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
- The multi-weighted Steiner tree problem: A reformulation by intersection
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
- A passenger demand model for airline flight scheduling and fleet routing
- Lagrangean decomposition/relaxation for the routing and wavelength assignment problem
- A variable target value method for nondifferentiable optimization
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
- A Primal Approach to the Simple Plant Location Problem
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
- A generalized subgradient method with relaxation step
- A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems
- Exact makespan minimization of unrelated parallel machines
- A heuristic method based on Lagrangean relaxation for a manufacturer's pallet loading problem
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- On the properties of the method of minimization for convex functions with relaxation on the distance to extremum
- A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods
- An exact algorithm for the modular hub location problem with single assignments
- The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems
- A Lagrangian relaxation approach to an electricity system investment model with a high temporal resolution
- A Lagrangian decomposition scheme for choice-based optimization
- The Kth TSP is pseudopolynomial when TSP is polynomial
- Lagrangian relaxation of the generic materials and operations planning model
- Data approximation by \(L^1\) spline fits with free knots
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133397)
