Pages that link to "Item:Q4838220"
From MaRDI portal
The following pages link to Solving the Continuous <i>p</i>-Dispersion Problem Using Non-linear Programming (Q4838220):
Displaying 15 items.
- Approximate solutions of continuous dispersion problems (Q816409) (← links)
- Solving circle packing problems by global optimization: numerical results and industrial applications (Q932199) (← links)
- Packing two disks in a polygon (Q1614067) (← links)
- Disk packing for the estimation of the size of a wire bundle (Q1764345) (← links)
- Reformulation descent applied to circle packing problems (Q1772872) (← links)
- The conditional \(p\)-dispersion problem (Q2046325) (← links)
- Repulsion-based p-dispersion with distance constraints in non-convex polygons (Q2070713) (← links)
- Convex maximization formulation of general sphere packing problem (Q2307930) (← links)
- Dense packing of congruent circles in free-form non-convex containers (Q2357688) (← links)
- Review of obnoxious facilities location problems (Q2669654) (← links)
- Model development and solver demonstrations using randomized test problems (Q2689552) (← links)
- Continuous approximation formulas for location problems (Q6085881) (← links)
- Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming (Q6090468) (← links)
- Optimal control sphere packing problem (Q6541617) (← links)
- Different formulations of the gray pattern problem and their optimal solutions (Q6586256) (← links)