Integer Programming: Methods, Uses, Computations

Cited in

(only showing first 100 items - show all)

Performance of a neural network method with set partitioning
Combined capacity planning and concentrator location in computer communications networks
A minimax problem for graphs and its relation to generalized doubly stochastic matrices
Facility location with increasing production costs
The general graph matching game: approximate core
Solving the plant location problem on a line by linear programming
Approximate core allocations for edge cover games
Near-optimal solutions to large-scale facility location problems
A bi-objective approach to discrete cost-bottleneck location problems
Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben
Application of optimization methods to the hematological support of patients with disseminated malignancies
SDP-based Benders decomposition for solving p-median quadratic facility location problems
Logical processing for integer programming
Computing solutions for matching games
Solving facility location problem based on duality approach
Properties of vertex packing and independence system polyhedra
An aggressive reduction scheme for the simple plant location problem
Kőnig's edge-colouring theorem for all graphs
A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm
Efficient stabilization of cooperative matching games
Counting vertices of integral polytopes defined by facets
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
Recoverable robust single machine scheduling with polyhedral uncertainty
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
On the diameter of lattice polytopes
Discrete facility location in machine learning
A randomized polynomial kernelization for vertex cover with a smaller parameter
The stratified p-center problem
On integer solutions to quadratic programs by a branch and bound technique
scientific article; zbMATH DE number 7525493 (Why is no real title available?)
The stochastic location model with risk pooling
A proof of the Boyd-Carr conjecture
Affinity propagation: An exemplar‐based tool for clustering in psychological research
Dual inequalities for stabilized column generation revisited
On fractional realizations of graph degree sequences
On the linear relaxation of the \(p\)-median problem
scientific article; zbMATH DE number 3557522 (Why is no real title available?)
Upgrading nodes in tree-shaped hub location
The complete vertex \(p\)-center problem
New valid inequalities and facets for the simple plant location problem
Résolution des programmes linéaires a variables mixtes par la procédure S.E.P.
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
A fundamental problem in linear inequalities with applications to the travelling salesman problem
Heuristic concentration: Two stage solution construction
Application of facility location modeling constructs to vendor selection problems
Frutex y caminos nodales
Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm
Les procedures arborescentes d’optimisation
A direct search method for the integer solution of the two-machine loading problem
Solving the \(p\)-median problem on regular and lattice networks
Popularity, Mixed Matchings, and Self-Duality
Revisiting a Cornuéjols-Nemhauser-Wolsey formulation for the \(\mathrm{p}\)-median problem
A cyclic allocation model for the inventory-modulated capacitated location problem
A note on duality gap in the simple plant location problem
On nonlinear optimization in integers
Fractional matroid matchings
Popular roommates in simply exponential time
Un algorithme de détermination de couvertures de cardinal minimal
Ein lexikographischer Suchalgorithmus zur ganzzahligen Programmierung: L E X S
Stable matchings and linear inequalities
Implicit enumeration algorithms for the set-partitioning problem
Modeling and algorithmic development of a staff scheduling problem
Affinity propagation and uncapacitated facility location problems
Fractionally total colouring \(G_{n,p}\)
A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application
Formulating logical implications in combinatorial optimisation
A separation algorithm for the simple plant location problem
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
Extreme point programming with nonlinear constraints
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
The set covering problem
An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem
The complexity of matching games: a survey
Vertices Belonging to All or to No Maximum Stable Sets of a Graph
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
A bibliography for some fundamental problem categories in discrete location science
A branch-and-price algorithm for facility location with general facility cost functions
Non-cooperative facility location and covering games
Una variante del algoritmo de Edmonds para acoplamientos Maximos
Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach
An efficient algorithm for minimumk-covers in weighted graphs
ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and \(G^2\)-connected medians
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
Solving linear optimization over arithmetic constraint formula
Location analysis: a synthesis and survey
A branch‐bound algorithm for the capacitated facilities location 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)