scientific article; zbMATH DE number 3614502
From MaRDI portal
zbMath0395.90056MaRDI QIDQ4178782
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Vector maximisation and lagrange multipliers, Lagrangean decomposition/relaxation for the routing and wavelength assignment problem, Unnamed Item, Hybrid approaches for the two-scenario max-min knapsack problem, Simultaneous Allocation of Berths and Quay Cranes under Discrete Berth Situation, Heuristic decomposition approach to buffer operation planning in a production process, A direct dual method for the mixed plant location problem with some side constraints, Dantzig-Wolfe decomposition for the facility location and production planning problem, Augmented Lagrangian based hybrid subgradient method for solving aircraft maintenance routing problem, Decomposition Branching for Mixed Integer Programming, Discrete facility location in machine learning, Matheuristics: survey and synthesis, Constrained shortest path tour problem: models, valid inequalities, and Lagrangian heuristics, Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods, A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs, Integrating train service route design with passenger flow allocation for an urban rail transit line, A Survey of the Generalized Assignment Problem and Its Applications, Refinement of Lagrangian bounds in optimization problems, Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities, Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem, Generalized cross decomposition applied to nonlinear integer programming problems: duality gaps and convexification in parts, Lagrangean decomposition: A model yielding stronger lagrangean bounds, The node-weighted steiner tree problem, A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows, A branch and bound algorithm for the generalized assignment problem, Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines, A simple modification of dantzig-wolfe decomposition, Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters, Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization, Analysis of a flow problem with fixed charges, Optimal prioritized channel allocation in cellular mobile systems, A dual algorithm for the one-machine scheduling problem, A multi-period network design problem for cellular telecommunication systems, Bundle-based relaxation methods for multicommodity capacitated fixed charge network design, The omnipresence of Lagrange, Mathematical Modeling of Scheduling Problems, Cotas inferiores para el QAP-Arbol, Quantity discount decisions under conditions of multiple items, multiple suppliers and resource limitations, A mathematical programming system for preference and compatibility maximized menu planning and scheduling, Modeling and solving a multimodal transportation problem with flexible-time and scheduled services, An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP, Solving capacitated part-routing problems with setup times and costs: a Dantzig-Wolfe decomposition-based solution approach, Mean value cross decomposition for nonlinear convex problems, Modeling and Managing Uncertainty in Process Planning and Scheduling, Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité, Integer programming duality: Price functions and sensitivity analysis, A relax‐and‐price heuristic for the inventory‐location‐routing problem, Cross decomposition for mixed integer programming, An ideal column algorithm for integer programs with special ordered sets of variables, An efficient lagrangean relaxation scheme for linear and integer equal flow problems, A Mixed-Integer PDE-Constrained Optimization Formulation for Electromagnetic Cloaking, A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations, A Primal Approach to the Simple Plant Location Problem, Optimal set partitioning, matchings and lagrangian duality, Some computational results on real 0-1 knapsack problems, The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm, Lagrangean relaxation and decomposition in an uncapacitated 2-hierarchal location-allocation problem, Tight bounds from a path based formulation for the tree of hub location problem, A new Lagrangian relaxation approach to the generalized assignment problem, A comparison of five heuristics for the multiple depot vehicle scheduling problem, A computational evaluation of two subgradient search methods, Representability in mixed integer programming. I: Characterization results, Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms, A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings, An algorithm for solving large capacitated warehouse location problems, A branch-cut-and-price algorithm for the piecewise linear transportation problem, On solving the Lagrangian dual of integer programs via an incremental approach, Surrogate duality in a branch-and-bound procedure for integer programming, Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound, A revised bound improvement sequence algorithm, The TV-break packing problem, An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems, Solving the \(p\)-median problem with a semi-Lagrangian relaxation, Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches, A shadow price in integer programming for management decision, Exploiting nested inequalities and surrogate constraints, Scenario cluster decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization, Cluster Lagrangean decomposition in multistage stochastic optimization, Solving a dynamic facility location problem with partial closing and reopening, Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities, Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs, Lower bounds for the two-stage uncapacitated facility location problem, Multiperiod optimal planning of thermal generation using cross decomposition, Solving network manpower problems with side constraints, Application of Lagrangian relaxation to computer network control, A hybrid approach of bundle and Benders applied large mixed linear integer problem, A new integer programming formulation for the permutation flowshop problem, A structural Lagrangean relaxation for two-duty period bus driver scheduling problems, Reducing the hierarchical network design problem, A Lagrangean approach to the degree-constrained minimum spanning tree problem, The quadratic knapsack problem -- a survey, A network relaxation based enumeration algorithm for set partitioning, An exact algorithm for the capacitated facility location problems with single sourcing, Spectral projected subgradient with a momentum term for the Lagrangean dual approach, A result on projection for the vehicle routing problem, Multiple machine continuous setup lotsizing with sequence-dependent setups, New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach, The combinatorial bandwidth packing problem, Use of Lagrangian decomposition in supply chain planning, A solution procedure for general knapsack problems with a few constraints, A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem, Stochastic dual dynamic programming applied to nonconvex hydrothermal models, A Lagrangean dual ascent algorithm for simple plant location problems, The traveling salesman problem with flexible coloring, Multi-level production scheduling for a class of flexible machining and assembly systems, A surrogate and Lagrangian approach to constrained network problems, Analysis of relaxations for the multi-item capacitated lot-sizing problem, Branching in branch-and-price: A generic scheme, Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design, Facility location for market capture when users rank facilities by shorter travel and waiting times, A decomposition-based pricing method for solving a large-scale MILP model for an integrated fishery, Optimization methods for mixed integer weakly concave programming problems, Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method, Exact augmented Lagrangian duality for mixed integer linear programming, Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems, The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times, The convex hull of two core capacitated network design problems, Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems, A reduction approach to the repeated assignment problem, Hub location-allocation in intermodal logistic networks, Multi-phase dynamic constraint aggregation for set partitioning type problems, An homage to Joseph-Louis Lagrange and Pierre Huard, Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search, Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique, A critical review of discrete filled function methods in solving nonlinear discrete optimization problems, The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation, A Benders decomposition based heuristic for the hierarchical production planning problem, On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems, Convergent Lagrangian and domain cut method for nonlinear knapsack problems, A column generation heuristic for a dynamic generalized assignment problem, On minimum \(k\)-modal partitions of permutations, A branch and bound algorithm for solving the multiple-choice knapsack problem, Multi-commodity supply network planning in the forest supply chain, Cut generation for an employee timetabling problem, Resource-constrained management of heterogeneous assets with stochastic deterioration, Clique inference process for solving Max-CSP, A heuristic algorithm for the multidimensional zero-one knapsack problem, Large-scale mixed integer programming: Benders-type heuristics, A heuristic lagrangean algorithm for the capacitated plant location problem, The zero-one knapsack problem with equality constraint, A comparison of two dual-based procedures for solving the p-median problem, A tree search algorithm for the multi-commodity location problem, Principal direction search: A new method of search for unconstrained LP formulations, Zero-one integer programs with few contraints - lower bounding theory, A multiple objective interactive Lagrangean relaxation approach, Capital budgeting with Benders' decomposition, A partial dual algorithm for the capacitated warehouse location problem, A facet generation and relaxation technique applied to an assignment problem with side constraints, A comparison of heuristics and relaxations for the capacitated plant location problem, Modelling a fertiliser distribution system, 'Multidimensional' extensions and a nested dual approach for the m-median problem, A decomposition method for large scale MILPs, with performance guarantees and a power system application, The multidimensional 0-1 knapsack problem -- bounds and computational aspects, Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem, An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem, Tabu search for nonlinear and parametric optimization (with links to genetic algorithms), Topological design of a centralized communication network with unreliable links and node outage costs, On using approximations of the Benders master problem, Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs, Multi-item capacitated lot-sizing by a cross decomposition based algorithm, Capacity analysis in repetitive assemble-to-order manufacturing systems, On the coordination of product and by-product flows in two-level distribution networks: Model formulations and solution procedures, A quadratic integer programming method for minimizing the mean squared deviation of completion times, Some applications of nonnegative linear systems: Farkas strikes again, Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem, The green capacitated multi-item lot sizing problem with parallel machines, Stochastic programming for qualification management of parallel machines in semiconductor manufacturing, Exact and approximation algorithms for makespan minimization on unrelated parallel machines, A branch-and-price algorithm for solving the cutting strips problem, Channel allocation in cellular radio networks, A heuristic method for lot-sizing in multi-stage systems, A model for the capacitated \(p\)-facility location problem in global environments, Average shadow price in a mixed integer linear programming problem, Polyhedral analysis and decompositions for capacitated plant location-type problems, A constrained Steiner tree problem, Solution of a tinned iron purchasing problem by Lagrangean relaxation, Exact and approximation algorithms for the operational fixed interval scheduling problem, Graph theoretic relaxations of set covering and set partitioning problems, A multicriteria approach to the location of public facilities, Set partitioning mit linearen Randbedingungen, Some aspects of integer programming duality, Optimization of multi-feeder (depot) printed circuit board manufacturing with error guarantees., A branch and bound algorithm for the acyclic subgraph problem, An exact algorithm for the maximum leaf spanning tree problem., Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints., A classroom/time assignment model, A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation, A heuristic decomposition approach to optimal control in a water supply model, An algorithm for single machine sequencing with deadlines to minimize total weighted completion time, The symmetric traveling salesman problem and edge exchanges in minimal 1- trees, Surrogate duality relaxation for job shop scheduling, Locational analysis, On the quadratic assignment problem, An extension of a greedy heuristic for the knapsack problem, Lagrangean decomposition for integer nonlinear programming with linear constraints, An improved bounding procedure for the constrained assignment problem, Exchanges procedures for timetabling problems, Topological design of computer communication networks -- the overall design problem, Correction to an article of Gavish and Pirkul, Flow network design for manufacturing systems layout, A system for priority routing and capacity assignment in packet switched networks, Capacitated lot-sizing and scheduling by Lagrangean relaxation, Lot-sizing polyhedra with a cardinality constraint, A survey of algorithms for the generalized assignment problem, Analysis of the Held-Karp lower bound for the asymmetric TSP, A complementary greedy heuristic for the knapsack problem, The multicovering problem, A decomposition technique for mixed integer programming problems, Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs, A scheduling model for the daily operation of an electric power system, Four solution techniques for a general one machine scheduling problem. A comparative study, The 0-1 knapsack problem with multiple choice constraints, An algorithm and efficient data structures for the binary knapsack problem, A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality, A due date assignment algorithm for multiproduct manufacturing facilities, Algebraic languages for mathematical programming, A survey of algorithms for the single machine total weighted tardiness scheduling problem, Facilities location in a competitive environment: A Promethee based multiple criteria analysis, Conditional subgradient optimization -- theory and applications, The capacitated distribution and waste disposal problem, Lagrangean methods for the 0-1 quadratic knapsack problem, Properties of some ILP formulations of a class of partitioning problems, 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, The asymmetric traveling salesman problem with replenishment arcs, An exact method for the two-echelon, single-source, capacitated facility location problem, A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints, Surrogate gradient algorithm for Lagrangian relaxation, Plant location with minimum inventory, Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem, Capacity planning for phased implementation of flexible manufacturing systems under budget restrictions, Minimal spanning trees with a constraint on the number of leaves, Efficient cuts in Lagrangean `relax-and-cut' schemes, A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem, Optimization of printed circuit board manufacturing: Integrated modeling and algorithms, Designing reliable tree networks with two cable technologies, A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem, The \(\gamma\)-connected assignment problem, Application of the scenario aggregation approach to a two-stage, stochastic, common component, inventory problem with a budget constraint, An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem, Cellular control of manufacturing systems, A branch and bound algorithm for symmetric 2-peripatetic salesman problems, On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems, Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems, A technique for speeding up the solution of the Lagrangean dual, Scheduling identical parallel machines to minimize total weighted completion time, A model and methodologies for the location problem with logistical components, The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm, Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking, A set partitioning heuristic for the generalized assignment problem, Average shadow prices in mathematical programming, State space relaxation for set covering problems related to bus driver scheduling, Lagrangean relaxation. (With comments and rejoinder)., On decomposition and multiobjective-based column and disjunctive cut generation for MINLP, A Lagrangian heuristic for the capacitated plant location problem with single source constraints, Ranking lower bounds for the bin-packing problem, The capacitated minimum spanning tree problem: On improved multistar constraints, A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem, A monotonic, dual-based bounding procedure for integer programs, A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements, The minimum weighted covering location problem with distance constraints, Modeling and solving the rooted distance-constrained minimum spanning tree problem, Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems, Optimizing stop plan and tickets allocation for high-speed railway based on uncertainty theory, Exploiting complete linear descriptions for decentralized power market problems with integralities, Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems, Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization, A comparison of formulations and relaxations for cross-dock door assignment problems, The multiple Steiner TSP with order constraints: complexity and optimization algorithms, Truck synchronization at single door cross-docking terminals, Discretized formulations for capacitated location problems with modular distribution costs, Multiobjective routing problems, The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming, Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints, Multi-period stochastic programming models for two-tiered emergency medical service system, Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem, Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints, A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements, Revisiting Lagrangian relaxation for network design, Stochastic dual dynamic integer programming, An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation, On the computational efficiency of subgradient methods: a case study with Lagrangian bounds, A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints, Reverse bridge theorem under constraint partition, A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines, Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes, Improving the performance of weighted Lagrange-multiplier methods for nonlinear constrained optimization, A decentralized approach to multi-agent MILPs: finite-time feasibility and performance guarantees, A location-routing problem for the conversion to the ``click-and-mortar retailing: the static case, A distributed computation algorithm for solving portfolio problems with integer variables, A relax-and-cut algorithm for the set partitioning problem, An improved cut-and-solve algorithm for the single-source capacitated facility location problem, A multiple server location-allocation model for service system design, Formulations and exact algorithms for the vehicle routing problem with time windows, An integrated staff-sizing approach considering feasibility of scheduling decision, Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths, The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time, A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems, A new cross decomposition method for stochastic mixed-integer linear programming, Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem, Stochastic facility location with general long-run costs and convex short-run costs, Comparison of bundle and classical column generation, The strength of Dantzig-Wolfe reformulations for the stable set and related problems, Decomposition-based inner- and outer-refinement algorithms for global optimization, Stabilized dynamic constraint aggregation for solving set partitioning problems, Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem, Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints, Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem, Heuristic solutions to the long-term unit commitment problem with cogeneration plants, A Lagrangian approach for minimum cost single round robin tournaments, A branch-and-bound algorithm for assembly line worker assignment and balancing problems, A dual bounding scheme for a territory design problem, The selection and scheduling of telecommunication calls with time windows, Bounds for the single source modular capacitated plant location problem, Decomposition and dynamic cut generation in integer linear programming, A generic view of Dantzig--Wolfe decomposition in mixed integer programming, Upper bounds and exact algorithms for \(p\)-dispersion problems, Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem, Exact disclosure prevention in two-dimensional statistical tables, Train timetabling for an urban rail transit line using a Lagrangian relaxation approach, Efficient generation of performance bounds for a class of traffic scheduling problems, An inventory-routing problem with the objective of travel time minimization, Automatic Dantzig-Wolfe reformulation of mixed integer programs, Solving network design problems via iterative aggregation, Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop, Lagrangean methods for 0-1 quadratic problems, Zero duality gap in integer programming: \(P\)-norm surrogate constraint method, Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type, Lagrangean/surrogate relaxation for generalized assignment problems, Lagrangian relaxation of the generic materials and operations planning model, Near-optimal large-scale k-medoids clustering, A decomposition method for structured linear and nonlinear programs, On the complexity of surrogate and group relaxation for integer linear programs, Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design, Future paths for integer programming and links to artificial intelligence, A feasibility-ensured Lagrangian heuristic for general decomposable problems, Multi-constrained matroidal knapsack problems, The simple plant location problem: Survey and synthesis, Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs, Duality in mathematics and linear and integer programming, An linear programming based lower bound for the simple assembly line balancing problem, The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price, On a primal-proximal heuristic in discrete optimization, Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem, Accelerating the convergence of subgradient optimisation, LP models for bin packing and cutting stock problems, Tool capacity planning in semiconductor manufacturing., Single machine scheduling with symmetric earliness and tardiness penalties, Asynchronous transfer mode networks with parallel links and multiple service classes, Convergence analysis for the modified spectral projected subgradient method, Dual-based heuristics for a hierarchical covering location problem, A nonlinear Lagrangian dual for integer programming
