The following pages link to Jack Brimberg (Q337668):
Displaying 50 items.
- New heuristic algorithms for solving the planar \(p\)-median problem (Q337669) (← links)
- A new heuristic for solving the \(p\)-median problem in the plane (Q339602) (← links)
- An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem (Q342496) (← links)
- Sequential clustering with radius and split criteria (Q351557) (← links)
- Locating an axis-parallel rectangle on a Manhattan plane (Q458948) (← links)
- New local searches for solving the multi-source Weber problem (Q512988) (← links)
- A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem (Q526415) (← links)
- General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem (Q526421) (← links)
- A note on reduction of quadratic and bilinear programs with equality constraints (Q598586) (← links)
- A variable neighborhood search based algorithm for finite-horizon Markov decision processes (Q613296) (← links)
- Geometric fit of a point set by generalized circles (Q652655) (← links)
- (Q689228) (redirect page) (← links)
- Local convergence in a generalized Fermat-Weber problem (Q689230) (← links)
- Probabilistic \(l_ p\) distances in location models (Q689232) (← links)
- Locating a general minisum `circle' on the plane (Q766255) (← links)
- A continuous location-allocation problem with zone-dependent fixed cost (Q816411) (← links)
- A note on duality gap in the simple plant location problem (Q858326) (← links)
- The \(p\)-median problem: a survey of metaheuristic approaches (Q864013) (← links)
- Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches (Q887199) (← links)
- Local and variable neighborhood search for the \(k\) -cardinality subgraph problem (Q953319) (← links)
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem (Q976311) (← links)
- Attraction probabilities in variable neighborhood search (Q989828) (← links)
- Variable neighborhood search for the heaviest \(k\)-subgraph (Q1025229) (← links)
- Locating a minisum circle in the plane (Q1028414) (← links)
- Extension of the Weiszfeld procedure to a single facility minisum location model with mixed \(\ell_{p}\) norms (Q1040688) (← links)
- An integrated model for the development of marginal water sources in the Negev Desert (Q1130021) (← links)
- Accelerating convergence in the Fermat-Weber location problem (Q1273094) (← links)
- Solving the plant location problem on a line by linear programming (Q1284603) (← links)
- Degeneracy in the multi-source Weber problem (Q1295966) (← links)
- Location and sizing of facilities on a line (Q1348709) (← links)
- Properties of three-dimensional median line location models (Q1413750) (← links)
- Location among regions with varying norms (Q1413752) (← links)
- A note on convergence in the single facility minisum location problem (Q1608453) (← links)
- Solving the clique partitioning problem as a maximally diverse grouping problem (Q1677299) (← links)
- A general framework for nested variable neighborhood search (Q1687670) (← links)
- Solving the capacitated clustering problem with variable neighborhood search (Q1730629) (← links)
- Local convexity results in a generalized Fermat-Weber problem (Q1806490) (← links)
- Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem (Q1885977) (← links)
- The Fermat-Weber location problem revisited (Q1924059) (← links)
- Solving the traveling repairman problem with profits: a novel variable neighborhood search approach (Q1999008) (← links)
- An efficient heuristic for a hub location routing problem (Q2070128) (← links)
- A non-triangular hub location problem (Q2191284) (← links)
- A new local search for continuous location problems (Q2255938) (← links)
- Solving multiple facilities location problems with separated clusters (Q2294344) (← links)
- Review of basic local searches for solving the minimum sum-of-squares clustering problem (Q2325257) (← links)
- Locating a median line with partial coverage distance (Q2349526) (← links)
- A note on the convexity of the expected queue length of the \(M/M/s\) queue with respect to the arrival rate: A third proof (Q2365561) (← links)
- Directional bias of the \(l_ p\)-norm (Q2367375) (← links)
- Locating a minisum annulus: a new partial coverage distance model (Q2408523) (← links)
- Fitting concentric circles to measurements (Q2441575) (← links)
