scientific article; zbMATH DE number 3410784

Nemhauser, George I., Robert Garfinkel

Publication date: 1972

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Integer programming (90C10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Multiple cost coefficients sensitivity theorems of integer linear optimization, Propositional calculus problems in CHIP, Combining and strengthening Gomory cuts, An Exact Method for the Minimum Feedback Arc Set Problem, Stable Payment Schemes of Tu-Games With Multiple Crieria¹, Classical cuts for mixed-integer programming and branch-and-cut, The ultradiscrete Toda lattice and the Smith normal form of bidiagonal matrices, Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory, A multi-period network design problem for cellular telecommunication systems, A time-dependent multiple criteria single-machine scheduling problem, Analyse de sensibilité pour les problèmes linéaires en variables 0-1, Integral decomposition in polyhedra, Incorporating Maintenance Infeasibilities in an Aircraft Rotation Planning Model, Revenue Sharing in Airline Alliance Networks, Die Lösung eines nichtlinearen Investitionsproblems mit Hilfe binärer Optimierungsalgorithmen — gezeigt am Beispiel der Planung regionaler Abwasserbehandlungssysteme, Trivial integer programs unsolvable by branch-and-bound, Perfect zero–one matrices, Simplex pivots on the set packing polytope, The reduced cost branch and bound algorithm for mixed integer programming, A heuristic for multiple choice programming, Optimal attribute sets for identifications and diagnoses, Entropy and set covering, Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP, A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem, Two new heuristics for the location set covering problem, Improved algorithm for mixed-integer quadratic programs and a computational study, Some results and experiments in programming techniques for propositional logic, Unnamed Item, A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems, Mathematical optimization and the synchronizing properties of encodings, A finite procedure to generate feasible points for the extreme point mathematical programming problem, An optimization model to determine master designs and runs for advertisement printing, A recursive Lagrangian method for clustering problems, Optimal resolution sequence of problems modelled by directed graphs, Unnamed Item, On a linearization technique for solving the quadratic set covering problem and variations, A reference direction approach to multiple objective integer linear programming, New technique for solving primal all-integer linear programming, Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints, Implicit enumeration algorithms for the set-partitioning problem, Set partitioning mit linearen Randbedingungen, A matching problem with side conditions, A Lagrangian treatment of certain nonlinear clustering problems, Tight bounds for periodicity theorems on the unbounded knapsack problem, A polynomial algorithm for solving systems of two linear diophantine equations, Pseudo-boolesche Verfahren zur Lösung nichtlinearer 0–1-Probleme: einige experimentelle Ergebnisse, The dynamic set covering problem, Improved integer programming bounds using intersections of corner polyhedra, Experimental results on Hillier's linear search, Conditional clusters, musters, and probability, Multi-objective routing within large scale facilities using open finite queueing networks, The travelling salesman problem and a class of polyhedra of diameter two, Combinatorial optimization problems with uncertain costs and the OWA criterion, An empirical analysis of exact algorithms for the unbounded knapsack problem, Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem, General neighborhood sequences in \(\mathbb Z^n\), A branch-and-bound combinatorial approach to level of repair analysis., A survey of recent developments in multiobjective optimization, Benders decomposition for set covering problems. Almost satisfying the consecutive ones property, Optimal pricing and composition of multiple bundles: a two-step approach, Multiple criteria dynamic programming and multiple knapsack problem, A constructive periodicity bound for the unbounded knapsack problem, Portfolio selection with divisible and indivisible assets: mathematical algorithm and economic analysis, Partial linear characterizations of the asymmetric travelling salesman polytope, Lineare Charakterisierungen von Travelling Salesman Problemen, Some of my favorite integer programming applications at IBM, Structural analysis of a fractional matching problem, Honey bees mating optimization algorithm for large scale vehicle routing problems, A dual algorithm for the one-machine scheduling problem, On the symmetric travelling salesman problem I: Inequalities, An investigation of new graph invariants related to the domination number of random proximity catch digraphs, Mixed integer minimization models for piecewise-linear functions of a single variable, A note on some computationally difficult set covering problems, Linear multiple objective programs with zero–one variables, Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem, Fractional knapsack problems, Static main storage packing problems, An upper bound for the zero-one knapsack problem and a branch and bound algorithm, A continuous variable representation of the traveling salesman problem, Discrete right hand side parametrization for linear integer programs, A generalized knapsack problem with variable coefficients, The Collapsing 0–1 Knapsack Problem, An extension of Hu's group minimization algorithm, Two stage linear programming under uncertainty with 0–1 integer first stage variables, Cluster generation and grouping using mathematical programming, AUGMENTED LAGRANGEAN RELAXATIONS IN GENERAL MIXED INTEGER PROGRAMMING, A generalised likelihood uncertainty estimation mixed-integer programming model: Application to a water resource distribution network, A hybrid algorithm for the unbounded knapsack problem, Optimal realignments of the teams in the National Football League, Analisis de estrategias en el ajuste lineal de funciones no-lineales en problemas de optimizacion, Page cuts for integer interval linear programming, A branch and bound algorithm for solving the multiple-choice knapsack problem, Least-cost partition algorithms, Unbounded knapsack problem: Dynamic programming revisited, A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem, Performance optimization of a class of discrete event dynamic systems using calculus of variations techniques, Heuristics for the 0-1 multidimensional knapsack problem, Tests for estimates of the tolerance relation based on pairwise comparisons in binary and multivalent form, Calculating uncertainty intervals in approximate equation systems, Mixed-integer quadratic programming, Transmission facility planning in telecommunications networks: A heuristic approach, Integer and mixed-integer programming models: General properties, Unit integer quadratic binary programming, An inexact programming approach for urban electric power systems management under random-interval-parameter uncertainty, An extension of the edge covering problem, The zero-one knapsack problem with equality constraint, The regional urban solid waste management system: A modelling approach, A successful algorithm for the undirected Hamiltonian path problem, A Sharp Bound for Solutions of Linear Diophantine Equations, A linear constraint satisfaction approach to cost-based abduction, Multicriteria integer programming: A (hybrid) dynamic programming recursive approach, A set covering reformulation of the pure fixed charge transportation problem, Worst case analysis of a class of set covering heuristics, The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm, Programmed Search in a Timetabling Problem over Finite Domains, Conjugate duality and the curse of dimensionality, Demand point aggregation for planar covering location models