Integer Programming: Methods, Uses, Computations

Cited In (only showing first 100 items - show all)

Evolutionary dynamics and equitable core selection in assignment games
Multiobjective analysis of facility location decisions
BEAMR: an exact and approximate model for the \(p\)-median problem
Modeling data envelopment analysis (DEA) efficient location/allocation decisions
Equitable representation and recruitment
IP over 40+ years at IBM scientific centers and marketing
Quasi-concave minimization subject to linear constraints
Optimizing location and size of rural schools in Chile
Generalized roof duality and bisubmodular functions
Structural analysis of a fractional matching problem
A Branch-and-Price Algorithm for Facility Location with General Facility Cost Functions
On the diameter of lattice polytopes
On integer solutions to quadratic programs by a branch and bound technique
The stochastic location model with risk pooling
Solving Facility Location Problem Based on Duality Approach
Dual inequalities for stabilized column generation revisited
On fractional realizations of graph degree sequences
On the linear relaxation of the \(p\)-median problem
The complete vertex \(p\)-center problem
A fundamental problem in linear inequalities with applications to the travelling salesman problem
New valid inequalities and facets for the simple plant location problem
Heuristic concentration: Two stage solution construction
Application of facility location modeling constructs to vendor selection problems
On nonlinear optimization in integers
A note on duality gap in the simple plant location problem
Fractional matroid matchings
Modeling and algorithmic development of a staff scheduling problem
Stable matchings and linear inequalities
Implicit enumeration algorithms for the set-partitioning problem
A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter
Formulating logical implications in combinatorial optimisation
A separation algorithm for the simple plant location problem
A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application
Voluntary formation of communities for the provision of public projects.
Warehouse location with production, inventory, and distribution decisions: a case study in the lube oil industry
An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem
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
Vertices Belonging to All or to No Maximum Stable Sets of a Graph
A bibliography for some fundamental problem categories in discrete location science
Location models for airline hubs behaving as \(M/D/c\) queues.
On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems
An efficient algorithm for minimumk-covers in weighted graphs
Non-cooperative facility location and covering games
Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach
Establishing the matching polytope
The impact of US tax depreciation law on asset location and ownership decisions
On a class of subadditive duals for the uncapacitated facility location problem
A branch‐bound algorithm for the capacitated facilities location problem
Location analysis: a synthesis and survey
Models and methods of solution of quadratic integer programming problems
An implicit enumeration program for zero-one integer programming
On a lemma of Scarf.
An application of a Lagrangian-type relaxation for the uncapacitated facility location problem
Euclidean semi-matchings of random samples
The simple plant location problem: Survey and synthesis
Steepest descent method for solving zero-one nonlinear programming problems
'Multidimensional' extensions and a nested dual approach for the m-median problem
Budget constrained location problem with opening and closing of facilities.
Fractional solutions for capacitated NTU-games, with applications to stable matchings
Minimum node covers and 2-bicritical graphs
Facility siting and integer-friendly programming
Combined capacity planning and concentrator location in computer communications networks
Performance of a neural network method with set partitioning
Facility location with increasing production costs
A minimax problem for graphs and its relation to generalized doubly stochastic matrices
Solving the plant location problem on a line by linear programming
Near-optimal solutions to large-scale facility location problems
A bi-objective approach to discrete cost-bottleneck location problems
Properties of vertex packing and independence system polyhedra
An aggressive reduction scheme for the simple plant location problem
Logical processing for integer programming
Computing solutions for matching games
Counting vertices of integral polytopes defined by facets
Efficient stabilization of cooperative matching games
Discrete facility location in machine learning
The stratified \(p\)-center problem
Title not available (Why is that?)
Affinity propagation: An exemplar‐based tool for clustering in psychological research
Title not available (Why is that?)
Résolution des programmes linéaires a variables mixtes par la procédure S.E.P.
Upgrading nodes in tree-shaped hub location
Effects of multipurpose shopping trips on retail store location in a duopoly
Improved integrality gap upper bounds for traveling salesperson problems with distances one and two
Hidden Hamiltonian Cycle Recovery via Linear Programming
Frutex y caminos nodales
Les procedures arborescentes d’optimisation
A direct search method for the integer solution of the two-machine loading problem
Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm
Popularity, Mixed Matchings, and Self-Duality
Solving the \(p\)-median problem on regular and lattice networks
A cyclic allocation model for the inventory-modulated capacitated location problem
Un algorithme de détermination de couvertures de cardinal minimal
Median Problems in Networks
Ein lexikographischer Suchalgorithmus zur ganzzahligen Programmierung: L E X S
Affinity propagation and uncapacitated facility location problems
Fractionally total colouring \(G_{n,p}\)
Extreme point programming with nonlinear constraints
The complexity of matching games: a survey
The set covering problem

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)