Pages that link to "Item:Q1180820"

The following pages link to Improved complexity bounds for location problems on the real line (Q1180820):

Displaying 46 items.

• The general facility location problem with connectivity on trees (Q335115) (← links)
• Representation of the non-dominated set in biobjective discrete optimization (Q342058) (← links)
• A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand (Q342327) (← links)
• Partial multicovering and the \(d\)-consecutive ones property (Q408373) (← links)
• Improved algorithms for path partition and related problems (Q408433) (← links)
• Locating an axis-parallel rectangle on a Manhattan plane (Q458948) (← links)
• New algorithms for facility location problems on the real line (Q517797) (← links)
• Online facility location with facility movements (Q539473) (← links)
• Improved complexity results for several multifacility location problems on trees (Q763099) (← links)
• Locating stops along bus or railway lines -- a bicriteria problem (Q816419) (← links)
• The directional \(p\)-median problem: definition, complexity, and algorithms (Q864030) (← links)
• Minimum \(L_k\) path partitioning-an illustration of the Monge property (Q924884) (← links)
• On the parameterized complexity of multiple-interval graph problems (Q1001898) (← links)
• A polynomial method for the pos/neg weighted 3-median problem on a tree (Q1006548) (← links)
• Improved algorithms for the multicut and multiflow problems in rooted trees (Q1024699) (← links)
• Aggregation error for location models: Survey and analysis (Q1026594) (← links)
• Continuous location problems and big triangle small triangle: Constructing better bounds (Q1037367) (← links)
• Multicuts and integral multiflows in rings (Q1041998) (← links)
• The least element property of center location on tree networks with applications to distance and precedence constrained problems (Q1319019) (← links)
• Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions (Q1331605) (← links)
• Location and sizing of facilities on a line (Q1348709) (← links)
• Structured \(p\)-facility location problems on the line solvable in polynomial time (Q1382805) (← links)
• 2-medians in trees with pos/neg weights (Q1582068) (← links)
• Strongly polynomial efficient approximation scheme for segmentation (Q1628675) (← links)
• Revisiting \(k\)-sum optimization (Q1675256) (← links)
• An improved lower bound for the multimedian location problem (Q1872010) (← links)
• On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines (Q2043623) (← links)
• Scheduling with gaps: new models and algorithms (Q2059088) (← links)
• Minsum \(k\)-sink problem on path networks (Q2285143) (← links)
• Capacitated Arc Stabbing (Q2376793) (← links)
• Locating public facilities by majority: stability, consistency and group formation (Q2466867) (← links)
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs (Q2564302) (← links)
• The coverage problem by aligned disks (Q2695288) (← links)
• Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane (Q2988724) (← links)
• An Improved Competitive Algorithm for One-Dimensional Incremental Median Problem (Q3004653) (← links)
• GEOMETRIC ALGORITHMS FOR THE CONSTRAINED 1-D K-MEANS CLUSTERING PROBLEMS AND IMRT APPLICATIONS (Q3634189) (← links)
• Efficient algorithms for centers and medians in interval and circular-arc graphs (Q4537621) (← links)
• Approximating Distance Measures for the Skyline (Q5091120) (← links)
• Optimal algorithms for selective variants of the classical and inverse median location problems on trees (Q5238068) (← links)
• Optimal Control Strategies for Incoming Inspection (Q5391875) (← links)
• On the <i>p</i>‐coverage problem on the real line (Q5422012) (← links)
• Information Loss in Grade Point Conversion (Q5438304) (← links)
• The \(k\)-centrum multi-facility location problem (Q5931794) (← links)
• Capacitated location-allocation problems on a line (Q5959397) (← links)
• The Coverage Problem by Aligned Disks (Q6173214) (← links)
• On the complexity of the upgrading version of the maximal covering location problem (Q6541022) (← links)