Pages that link to "Item:Q1037367"
From MaRDI portal
The following pages link to Continuous location problems and big triangle small triangle: Constructing better bounds (Q1037367):
Displaying 20 items.
- \(p\)-facility Huff location problem on networks (Q323476) (← links)
- Continuous location of an assembly station (Q356516) (← links)
- A global optimization procedure for the location of a median line in the three-dimensional space (Q421608) (← links)
- Locating a competitive facility in the plane with a robustness criterion (Q421609) (← links)
- A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments (Q458952) (← links)
- Single-facility huff location problems on networks (Q490213) (← links)
- Sequential location of two facilities: comparing random to optimal location of the first facility (Q512975) (← links)
- The theoretical and empirical rate of convergence for geometric branch-and-bound methods (Q609566) (← links)
- The multicriteria big cube small cube method (Q611015) (← links)
- Theoretical rate of convergence for interval inclusion functions (Q695339) (← links)
- On the norm of a dc function (Q708897) (← links)
- On minimax-regret Huff location models (Q709114) (← links)
- Visualizing data as objects by DC (difference of convex) optimization (Q1749447) (← links)
- Gradual cover competitive facility location (Q2197154) (← links)
- A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables (Q2255939) (← links)
- A cross-monotonic cost-sharing scheme for the concave facility location game (Q2393059) (← links)
- Geometric branch-and-bound methods for constrained global optimization problems (Q2434637) (← links)
- Solving the median problem with continuous demand on a network (Q2636614) (← links)
- Solving a Huff-like Stackelberg location problem on networks (Q5964240) (← links)
- Solving the 1-median problem on a network with continuous demand and demand surplus (Q6068730) (← links)