scientific article; zbMATH DE number 3614502

Cited in

(only showing first 100 items - show all)

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
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
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
Capital budgeting with Benders' decomposition
A partial dual algorithm for the capacitated warehouse location problem
'Multidimensional' extensions and a nested dual approach for the m-median problem
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
A new Lagrangian relaxation approach to the generalized assignment 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
An algorithm for solving large capacitated warehouse location problems
Surrogate duality in a branch-and-bound procedure for integer programming
A revised bound improvement sequence algorithm
A shadow price in integer programming for management decision
Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
Application of Lagrangian relaxation to computer network control
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
A network relaxation based enumeration algorithm for set partitioning
An exact algorithm for the capacitated facility location problems with single sourcing
A result on projection for the vehicle routing problem
Average shadow price in a mixed integer linear programming problem
A constrained Steiner tree problem
Solution of a tinned iron purchasing problem by Lagrangean relaxation
A multicriteria approach to the location of public facilities
Set partitioning mit linearen Randbedingungen
Some aspects of integer programming duality
A branch and bound algorithm for the acyclic subgraph problem
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
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
Designing reliable tree networks with two cable technologies
The -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
A technique for speeding up the solution of the Lagrangean dual
Scheduling identical parallel machines to minimize total weighted completion time
The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm
Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking

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 Q4178782)