scientific article

Nemhauser, George I., Robert Garfinkel

Publication date: 1973

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

Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items

An algorithm for the bi-criterion integer programming problem, Optimal and heuristic algorithms for multiproduct uncapacitated facility location, An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem, On equivalent knapsack problems, Computing leximin-optimal solutions in constraint networks, A simple strategy for solving a class of 0-1 integer programming models, Structural analysis of local search heuristics in combinatorial optimization, Adding activities to the dual instead of cuts to the primal problem, A parallel integer linear programming algorithm, A shadow price in integer programming for management decision, A heuristic solution procedure for multicommodity integer flows, A unified approach for price directive decomposition procedures in integer programming, A forward algorithm and planning horizon procedure for the production smoothing problem without inventory, A binary integer linear program with multi-criteria and multi-constraint levels, Pick-and-choose heuristics for partial set covering, On aggregating two linear diophantine equations, Enumeration technique for solving multi-objective quadratic set-covering problem using goal programming, Comments on practical implementation of Gomory's fractional algorithm, Graph theoretic relaxations of set covering and set partitioning problems, Continued fractions and explicit solutions of a particular discrete optimization problem, A number theoretic reformulation and decomposition method for integer programming, Levelling terrain trees: A transshipment problem, Related necessary conditions for completing partial latin squares, Some aspects of integer programming duality, A Linearization technique for solving the quadratic set covering problem, Discrete extremal problems, A separable integer programming problem equivalent to its continual version, Adjacent vertices on the b-matching polyhedron, On maintenance scheduling of production units, Optimal assignment of broadcasting frequencies, A note on the m-center problem with rectilinear distances, An exact algorithm for large unbounded knapsack problems, An algorithm for the multiple objective integer linear programming problem, A transfer algorithm for hierarchical clustering, Identification of non-optimal arcs for the traveling salesman problem, The additivity and dummy axioms in the discrete cost sharing model, A heuristic decomposition approach to optimal control in a water supply model, Equivalent weights for lexicographic multi-objective programs: Characterizations and computations, An interactive dynamic programming approach to multicriteria discrete programming, A characterisation of all feasible solutions to an integer program, Locational analysis, Optimal data placement on networks with a constant number of clients, An extension of a greedy heuristic for the knapsack problem, Valid integer polytope (VIP) penalties for branch-and-bound enumeration, Solving a cutting-stock problem with the constraint logic programming language CHIP, Performance of a neural network method with set partitioning, A goal programming approach to solve linear fractional multi-objective set covering problem., A complementary greedy heuristic for the knapsack problem, Polyhedral methods for piecewise-linear functions. I: The lambda method, Accelerating Greenberg's method for the computation of knapsack functions, On the facial structure of set packing polyhedra, Acyclic orientations of a graph and the chromatic and independence numbers, Parametric-objective integer programming using knapsack facets and Gomory cutting planes, A computational comparison of Gomory and knapsack cuts, A note on the total unimodularity of matrices, Approximate algorithms for some generalized knapsack problems, Almost integral polyhedra related to certain combinatorial optimization problems, A network solution to a general vehicle scheduling problem, Branching from the largest upper bound. Folklore and facts, Simplification of Boolean-valued data by minimum covering, Production-inventory games: A new class of totally balanced combinatorial optimization games, A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems, A Stackelberg equilibrium for a missile procurement problem, Cutting-plane theory: Algebraic methods, On the distribution of the domination number for random class cover catch digraphs, Implied constraints and an alternate unified development of nonlinear programming theory, A relation between the knapsack and group knapsack problems, A gentle introduction to Numerica, Future paths for integer programming and links to artificial intelligence, Simple Lagrangian heuristic for the set covering problem, An algorithm for set covering problem, Single value simulation of fuzzy variable - some further results, Use of location-allocation models in health service development planning in developing nations, Choosing robust solutions in discrete optimization problems with fuzzy costs, Labeling algorithms for multiple objective integer knapsack problems, A simple, all primal branch and bound approach to pure and mixed integer binary programs, The simple plant location problem: Survey and synthesis, Gomory cuts revisited, A successful algorithm for solving directed Hamiltonian path problems, Optimal weighing designs with a string property, An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem, Capital budgeting with Benders' decomposition, Properties of vertex packing and independence system polyhedra, An algorithm of internal feasible directions for linear integer programming, Two simple applications of the unmodularity property, An algorithm for the periodic solutions in the knapsack problem