Pages that link to "Item:Q697575"

The following pages link to Discrete location problems with push-pull objectives (Q697575):

Displaying 14 items.

• Novel dual discounting functions for the Internet shopping optimization problem: new algorithms (Q310335) (← links)
• Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs (Q326228) (← links)
• Internet shopping with price sensitive discounts (Q457290) (← links)
• A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint (Q830937) (← links)
• A polynomial method for the pos/neg weighted 3-median problem on a tree (Q1006548) (← links)
• Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
• Reverse 1-maxian problem with keeping existing 1-median (Q1735954) (← links)
• Overcoming human trafficking via operations research and analytics: opportunities for methods, models, and applications (Q1751884) (← links)
• Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
• Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network (Q2271121) (← links)
• Locating a semi-obnoxious covering facility with repelling polygonal regions (Q2444554) (← links)
• The \(p\)-maxian problem on a tree (Q2467473) (← links)
• Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032) (← links)
• A modified optimal algorithm for 2-maxian location problems on cactus graphs (Q2979777) (← links)