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