Publication:3214706
From MaRDI portal
zbMath0271.90028MaRDI QIDQ3214706
Nemhauser, George I., Robert Garfinkel
Publication date: 1973
65K05: Numerical mathematical programming methods
90C10: Integer programming
90B10: Deterministic network models in operations research
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
90-04: Software, source code, etc. for problems pertaining to operations research and mathematical programming
Related Items
A Linearization technique for solving the quadratic set covering problem, Properties of vertex packing and independence system polyhedra, On the facial structure of set packing polyhedra, Polyhedral methods for piecewise-linear functions. I: The lambda method, On the distribution of the domination number for random class cover catch digraphs, Parametric-objective integer programming using knapsack facets and Gomory cutting planes, A computational comparison of Gomory and knapsack cuts, A forward algorithm and planning horizon procedure for the production smoothing problem without inventory, A successful algorithm for solving directed Hamiltonian path problems, Optimal weighing designs with a string property, An algorithm of internal feasible directions for linear integer programming, A note on the m-center problem with rectilinear distances, An exact algorithm for large unbounded knapsack problems, Production-inventory games: A new class of totally balanced combinatorial optimization games, Capital budgeting with Benders' decomposition, An algorithm for the periodic solutions in the knapsack problem, An algorithm for the bi-criterion integer programming problem, Optimal and heuristic algorithms for multiproduct uncapacitated facility location, On equivalent knapsack problems, 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 unified approach for price directive decomposition procedures in integer programming, Pick-and-choose heuristics for partial set covering, Comments on practical implementation of Gomory's fractional algorithm, Continued fractions and explicit solutions of a particular discrete optimization problem, Levelling terrain trees: A transshipment problem, Related necessary conditions for completing partial latin squares, Some aspects of integer programming duality, 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, 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, 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, An extension of a greedy heuristic for the knapsack problem, Solving a cutting-stock problem with the constraint logic programming language CHIP, Performance of a neural network method with set partitioning, A complementary greedy heuristic for the knapsack problem, Accelerating Greenberg's method for the computation of knapsack functions, Acyclic orientations of a graph and the chromatic and independence numbers, 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, A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems, Cutting-plane theory: Algebraic methods, 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, Simple Lagrangian heuristic for the set covering problem, An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem, Two simple applications of the unmodularity property, An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem, A binary integer linear program with multi-criteria and multi-constraint levels, On aggregating two linear diophantine equations, Graph theoretic relaxations of set covering and set partitioning problems, A number theoretic reformulation and decomposition method for integer programming, Use of location-allocation models in health service development planning in developing nations, Future paths for integer programming and links to artificial intelligence, An algorithm for set covering problem, Single value simulation of fuzzy variable - some further results, A simple, all primal branch and bound approach to pure and mixed integer binary programs, The simple plant location problem: Survey and synthesis, A heuristic solution procedure for multicommodity integer flows, The additivity and dummy axioms in the discrete cost sharing model, Valid integer polytope (VIP) penalties for branch-and-bound enumeration, A goal programming approach to solve linear fractional multi-objective set covering problem., A Stackelberg equilibrium for a missile procurement problem, Gomory cuts revisited
