Pages that link to "Item:Q733530"
From MaRDI portal
The following pages link to A continuous analysis framework for the solution of location-allocation problems with dense demand (Q733530):
Displaying 16 items.
- A quadtree-based allocation method for a class of large discrete Euclidean location problems (Q337393) (← links)
- A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand (Q342327) (← links)
- Comparative error bound theory for three location models: continuous demand versus discrete demand (Q458944) (← links)
- Optimal transport and a bilevel location-allocation problem (Q506454) (← links)
- A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand (Q709182) (← links)
- A heuristic algorithm for solving large location-inventory problems with demand uncertainty (Q1751826) (← links)
- A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms (Q1782170) (← links)
- Allocation of discrete demand with changing costs (Q1819240) (← links)
- A continuous approximation approach for the integrated facility-inventory allocation problem (Q1926929) (← links)
- Location problems with continuous demand and unreliable facilities: applications of families of incremental Voronoi diagrams (Q2030244) (← links)
- On location-allocation problems for dimensional facilities (Q2317850) (← links)
- Joint location, inventory, and preservation decisions for non-instantaneous deterioration items under delay in payments (Q2795160) (← links)
- A Planar Location-Allocation Problem with Waiting Time Costs (Q2945442) (← links)
- Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand (Q3453339) (← links)
- (Q3598873) (← links)
- Replacing continuous demand with discrete demand in a competitive location model (Q4346868) (← links)
