Integer Programming: Methods, Uses, Computations

Cited in

(only showing first 100 items - show all)

'Multidimensional' extensions and a nested dual approach for the m-median problem
Implicit enumeration algorithms for the set-partitioning problem
Euclidean semi-matchings of random samples
Performance of a neural network method with set partitioning
Quasi-concave minimization subject to linear constraints
Application of optimization methods to the hematological support of patients with disseminated malignancies
Facility siting and integer-friendly programming
Heuristic concentration: Two stage solution construction
Solving the plant location problem on a line by linear programming
Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach
On the equivalence between roof duality and Lagrangian duality for unconstrained 0-1 quadratic programming problems
Application of facility location modeling constructs to vendor selection problems
Stable matchings and linear inequalities
On a lemma of Scarf.
Budget constrained location problem with opening and closing of facilities.
Location models for airline hubs behaving as M/D/c queues.
Voluntary formation of communities for the provision of public projects.
Formulating logical implications in combinatorial optimisation
A bi-objective approach to discrete cost-bottleneck location problems
Upgrading nodes in tree-shaped hub location
Solving linear optimization over arithmetic constraint formula
Another pedagogy for mixed-integer Gomory
Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm
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
Improved integrality gap upper bounds for traveling salesperson problems with distances one and two
Location analysis: a synthesis and survey
Near-optimal solutions to large-scale facility location problems
Fractional matroid matchings
The simple plant location problem: Survey and synthesis
Facility location with increasing production costs
The stratified p-center problem
A separation algorithm for the simple plant location problem
The general graph matching game: approximate core
The complete vertex \(p\)-center problem
An application of a Lagrangian-type relaxation for the uncapacitated facility location problem
An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem
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
Kőnig's edge-colouring theorem for all graphs
Fractionally total colouring \(G_{n,p}\)
An aggressive reduction scheme for the simple plant location problem
Establishing the matching polytope
Extreme point programming with nonlinear constraints
Multiobjective analysis of facility location decisions
Solving the \(p\)-median problem on regular and lattice networks
Dual inequalities for stabilized column generation revisited
On the diameter of lattice polytopes
Optimizing location and size of rural schools in Chile
Solving facility location problem based on duality approach
Minimum node covers and 2-bicritical graphs
A randomized polynomial kernelization for vertex cover with a smaller parameter
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
Una variante del algoritmo de Edmonds para acoplamientos Maximos
Combined capacity planning and concentrator location in computer communications networks
Frutex y caminos nodales
Models and methods of solution of quadratic integer programming problems
The set covering problem
Vertices Belonging to All or to No Maximum Stable Sets of a Graph
On fractional realizations of graph degree sequences
An efficient algorithm for minimumk-covers in weighted graphs
Ein lexikographischer Suchalgorithmus zur ganzzahligen Programmierung: L E X S
Generalized roof duality and bisubmodular functions
scientific article; zbMATH DE number 3557522 (Why is no real title available?)
On the linear relaxation of the \(p\)-median problem
Affinity propagation: An exemplar‐based tool for clustering in psychological research
A minimax problem for graphs and its relation to generalized doubly stochastic matrices
Properties of vertex packing and independence system polyhedra
On integer solutions to quadratic programs by a branch and bound technique
A branch-and-price algorithm for facility location with general facility cost functions
Popularity, Mixed Matchings, and Self-Duality
A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm
Towards improving Christofides algorithm for half-integer TSP
Discrete facility location in machine learning
Hidden Hamiltonian cycle recovery via linear programming
Sur l'utilisation de troncatures de Gomory dans les algorithmes énumératifs
Efficient stabilization of cooperative matching games
Equitable representation and recruitment
IP over 40+ years at IBM scientific centers and marketing
A capacitated facility location problem with constrained backlogging probabilities
Median problems in networks
On nonlinear optimization in integers
Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben
A branch‐bound algorithm for the capacitated facilities location problem
Résolution des programmes linéaires a variables mixtes par la procédure S.E.P.
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
A proof of the Boyd-Carr conjecture
A cyclic allocation model for the inventory-modulated capacitated location problem
Modeling and algorithmic development of a staff scheduling problem
Affinity propagation and uncapacitated facility location problems
Counting vertices of integral polytopes defined by facets
The complexity of matching games: a survey
A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools

This page was built for publication: Integer Programming: Methods, Uses, Computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5337705)