Integer Programming: Methods, Uses, Computations
From MaRDI portal
Publication:5337705
DOI10.1287/mnsc.12.3.253zbMath0129.12004OpenAlexW1992428442WikidataQ60174233 ScholiaQ60174233MaRDI QIDQ5337705
Publication date: 1965
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.12.3.253
Related Items
A cyclic allocation model for the inventory-modulated capacitated location problem, Counting vertices of integral polytopes defined by facets, Les procedures arborescentes d’optimisation, A fundamental problem in linear inequalities with applications to the travelling salesman problem, A direct search method for the integer solution of the two-machine loading problem, An implicit enumeration program for zero-one integer programming, Un algorithme de détermination de couvertures de cardinal minimal, Modeling and algorithmic development of a staff scheduling problem, Affinity propagation and uncapacitated facility location problems, Unnamed Item, On nonlinear optimization in integers, A bi-objective approach to discrete cost-bottleneck location problems, Application of facility location modeling constructs to vendor selection problems, Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben, On the diameter of lattice polytopes, Stable matchings and linear inequalities, Upgrading nodes in tree-shaped hub location, A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter, A branch‐bound algorithm for the capacitated facilities location problem, A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm, The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm, Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem, Unnamed Item, Multiobjective analysis of facility location decisions, A bibliography for some fundamental problem categories in discrete location science, BEAMR: an exact and approximate model for the \(p\)-median problem, Modeling data envelopment analysis (DEA) efficient location/allocation decisions, A note on duality gap in the simple plant location problem, The stochastic location model with risk pooling, Solving the \(p\)-median problem on regular and lattice networks, Solving linear optimization over arithmetic constraint formula, Solving Facility Location Problem Based on Duality Approach, The impact of US tax depreciation law on asset location and ownership decisions, Combined capacity planning and concentrator location in computer communications networks, Discrete facility location in machine learning, Evolutionary dynamics and equitable core selection in assignment games, Another pedagogy for mixed-integer Gomory, On fractional realizations of graph degree sequences, Implicit enumeration algorithms for the set-partitioning problem, Generalized roof duality and bisubmodular functions, Résolution des programmes linéaires a variables mixtes par la procédure S.E.P., On a lemma of Scarf., On a class of subadditive duals for the uncapacitated facility location problem, On the linear relaxation of the \(p\)-median problem, Budget constrained location problem with opening and closing of facilities., Location models for airline hubs behaving as \(M/D/c\) queues., Hidden Hamiltonian Cycle Recovery via Linear Programming, Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm, Voluntary formation of communities for the provision of public projects., The complete vertex \(p\)-center problem, Kőnig's edge-colouring theorem for all graphs, Affinity propagation: An exemplar‐based tool for clustering in psychological research, Models and methods of solution of quadratic integer programming problems, Computing solutions for matching games, An efficient algorithm for minimumk-covers in weighted graphs, Euclidean semi-matchings of random samples, Ein lexikographischer Suchalgorithmus zur ganzzahligen Programmierung: L E X S, New valid inequalities and facets for the simple plant location problem, Effects of multipurpose shopping trips on retail store location in a duopoly, Fractional solutions for capacitated NTU-games, with applications to stable matchings, Performance of a neural network method with set partitioning, Improved integrality gap upper bounds for traveling salesperson problems with distances one and two, Efficient stabilization of cooperative matching games, Non-cooperative facility location and covering games, Fractionally total colouring \(G_{n,p}\), The stratified \(p\)-center problem, Equitable representation and recruitment, IP over 40+ years at IBM scientific centers and marketing, An application of a Lagrangian-type relaxation for the uncapacitated facility location problem, Structural analysis of a fractional matching problem, Quasi-concave minimization subject to linear constraints, Unnamed Item, A capacitated facility location problem with constrained backlogging probabilities, Application of optimization methods to the hematological support of patients with disseminated malignancies, Sur l'utilisation de troncatures de Gomory dans les algorithmes énumératifs, An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem, Location analysis: a synthesis and survey, Minimum node covers and 2-bicritical graphs, Near-optimal solutions to large-scale facility location problems, Una variante del algoritmo de Edmonds para acoplamientos Maximos, Steepest descent method for solving zero-one nonlinear programming problems, A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application, An aggressive reduction scheme for the simple plant location problem, Dual Inequalities for Stabilized Column Generation Revisited, Warehouse location with production, inventory, and distribution decisions: a case study in the lube oil industry, Facility siting and integer-friendly programming, A minimax problem for graphs and its relation to generalized doubly stochastic matrices, Fractional matroid matchings, The set covering problem, A separation algorithm for the simple plant location problem, Heuristic concentration: Two stage solution construction, Establishing the matching polytope, Solving the plant location problem on a line by linear programming, The general graph matching game: approximate core, Extreme point programming with nonlinear constraints, A Branch-and-Price Algorithm for Facility Location with General Facility Cost Functions, The simple plant location problem: Survey and synthesis, Popularity, Mixed Matchings, and Self-Duality, Median Problems in Networks, Frutex y caminos nodales, Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach, Formulating logical implications in combinatorial optimisation, Optimizing location and size of rural schools in Chile, On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems, Properties of vertex packing and independence system polyhedra, 'Multidimensional' extensions and a nested dual approach for the m-median problem, Facility location with increasing production costs, On integer solutions to quadratic programs by a branch and bound technique, Logical processing for integer programming, Vertices Belonging to All or to No Maximum Stable Sets of a Graph