The following pages link to Antonio M. Rodríguez-Chía (Q319963):
Displayed 50 items.
- Capacitated \(p\)-center problem with failure foresight (Q319964) (← links)
- Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem (Q323162) (← links)
- Accelerating convergence in minisum location problem with \(\ell p\) norms (Q336624) (← links)
- On discrete optimization with ordering (Q367635) (← links)
- Alternative formulations for the set packing problem and their application to the winner determination problem (Q367639) (← links)
- A branch-and-cut algorithm for the maximum benefit Chinese postman problem (Q378087) (← links)
- Closest assignment constraints in discrete location problems (Q439609) (← links)
- On the structure of the solution set for the single facility location problem with average distances (Q543416) (← links)
- The ordered capacitated facility location problem (Q611009) (← links)
- On solving the planar \(k\)-centrum problem with Euclidean distances (Q613427) (← links)
- Simultaneous location of a service facility and a rapid transit line (Q709200) (← links)
- Single-allocation ordered median hub location problems (Q709204) (← links)
- Stochastic set packing problem (Q713096) (← links)
- (Q813975) (redirect page) (← links)
- On the exponential cardinality of FDS for the ordered \(p\)-median problem (Q813976) (← links)
- A comparison of formulations and solution methods for the minimum-envy location problem (Q1000990) (← links)
- Convex ordered median problem with \(\ell _p\)-norms (Q1013404) (← links)
- The single facility location problem with average-distances (Q1024705) (← links)
- Distribution systems design with role dependent objectives (Q1039797) (← links)
- Weber problems with alternative transportation systems (Q1278584) (← links)
- Location of a moving service facility (Q1304413) (← links)
- A multicriteria competitive Markov decision process (Q1397064) (← links)
- Lagrangian relaxation for SVM feature selection (Q1652409) (← links)
- Revisiting \(k\)-sum optimization (Q1675256) (← links)
- The probabilistic \(p\)-center problem: planning service for potential customers (Q1683071) (← links)
- Reformulated acyclic partitioning for rail-rail containers transshipment (Q1735174) (← links)
- Clustering data that are graph connected (Q1753555) (← links)
- Multi-period stochastic covering location problems: modeling framework and solution approach (Q1754338) (← links)
- Corrigendum to ``Simultaneous location of a service facility and a rapid transit line'' [Computers \& Operations Research 38 (2) (2011) 525-538] (Q1761239) (← links)
- Geometrical description of the weakly efficient solution set for multicriteria location problems (Q1872034) (← links)
- On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\) (Q1942259) (← links)
- A flexible approach to location problems (Q1974022) (← links)
- The stratified \(p\)-center problem (Q2003436) (← links)
- A branch-and-price procedure for clustering data that are graph connected (Q2060392) (← links)
- The hub location and pricing problem (Q2140288) (← links)
- A mathematical programming approach to overlapping community detection (Q2162210) (← links)
- Tightening big Ms in integer programming formulations for support vector machines with ramp loss (Q2184093) (← links)
- On pricing-based equilibrium for network expansion planning. A multi-period bilevel approach under uncertainty (Q2189937) (← links)
- The multicriteria \(p\)-facility median location problem on networks (Q2256313) (← links)
- On the planar piecewise quadratic 1-center problem (Q2379920) (← links)
- Lexicographical order in integer programming (Q2405486) (← links)
- Mixed integer linear programming for feature selection in support vector machine (Q2414473) (← links)
- A specialized branch \& bound \& cut for single-allocation ordered median hub location problems (Q2444555) (← links)
- Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets (Q2456634) (← links)
- Primal-dual simplex method for multiobjective linear programming (Q2471113) (← links)
- New models for locating a moving service facility (Q2500782) (← links)
- The \(p\)-facility ordered median problem on networks (Q2568602) (← links)
- Multicriteria planar ordered median problems (Q2583208) (← links)
- A comparative study of different formulations for the capacitated discrete ordered median problem (Q2664433) (← links)
- Minmax regret maximal covering location problems with edge demands (Q2668649) (← links)