Pages that link to "Item:Q4135210"
From MaRDI portal
The following pages link to Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms (Q4135210):
Displaying 50 items.
- Multi-level facility location as the maximization of a submodular set function (Q320143) (← links)
- Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound (Q323168) (← links)
- \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis (Q337587) (← links)
- Local search heuristics for the mobile facility location problem (Q337654) (← links)
- Fast approximate energy minimization with label costs (Q409135) (← links)
- On the linear relaxation of the \(p\)-median problem (Q429694) (← links)
- A new warmstarting strategy for the primal-dual column generation method (Q494315) (← links)
- New performance guarantees for the greedy maximization of submodular set functions (Q523157) (← links)
- Hooked on IP (Q537605) (← links)
- IP over 40+ years at IBM scientific centers and marketing (Q537612) (← links)
- Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← links)
- Facility location models for distribution system design (Q707128) (← links)
- Performance bounds with curvature for batched greedy optimization (Q725886) (← links)
- Phylogenetic diversity and the maximum coverage problem (Q735104) (← links)
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing (Q750288) (← links)
- Meaningfulness of conclusions from combinatorial optimization (Q750310) (← links)
- Competitive location on networks under delivered pricing (Q753680) (← links)
- Network production-location problems under price uncertainty (Q788616) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem (Q790044) (← links)
- A branch-and-bound algorithm for the multi-level uncapacitated facility location problem (Q795714) (← links)
- Using a facility location algorithm to solve large set covering problems (Q796457) (← links)
- A heuristic lagrangean algorithm for the capacitated plant location problem (Q797475) (← links)
- Modelling a fertiliser distribution system (Q811356) (← links)
- An improved IP formulation for the uncapacitated facility location problem: capitalizing on objective function structure (Q816402) (← links)
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
- Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid (Q817555) (← links)
- Influence maximization problem: properties and algorithms (Q830929) (← links)
- Analysis of decomposition algorithms with Benders cuts for \(p\)-median problem (Q853803) (← links)
- Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort (Q856273) (← links)
- The \(p\)-median problem: a survey of metaheuristic approaches (Q864013) (← links)
- Algorithms for central-median paths with bounded length on trees (Q864041) (← links)
- Strategic design of distribution systems with economies of scale in transportation (Q867550) (← links)
- Computational study of large-scale \(p\)-median problems (Q868446) (← links)
- Simultaneous selection (Q906442) (← links)
- A Lagrangean dual ascent algorithm for simple plant location problems (Q911446) (← links)
- A projection method for the uncapacitated facility location problem (Q918404) (← links)
- A method for solving to optimality uncapacitated location problems (Q920004) (← links)
- Analysis of relaxations for the multi-item capacitated lot-sizing problem (Q922259) (← links)
- Optimal partitioning of a data set based on the \(p\)-median model (Q946677) (← links)
- On the \(p\)-median polytope of \(Y\)-free graphs (Q951093) (← links)
- Approximability of minimum AND-circuits (Q1024782) (← links)
- Aggregation error for location models: Survey and analysis (Q1026594) (← links)
- A computational evaluation of a general branch-and-price framework for capacitated network location problems (Q1026595) (← links)
- Exemplar-based clustering via simulated annealing (Q1036142) (← links)
- Heuristics for the capacitated plant location model (Q1051554) (← links)
- A comparison of two dual-based procedures for solving the p-median problem (Q1058960) (← links)
- A tree search algorithm for the multi-commodity location problem (Q1058962) (← links)
- ASEAN industrial cooperation: The case of multi-product capacity expansion (Q1064970) (← links)
