Pages that link to "Item:Q761347"

The following pages link to An O(n) algorithm for the linear multiple choice knapsack problem and related problems (Q761347):

Displaying 39 items.

• Computing the geodesic center of a simple polygon (Q582099) (← links)
• A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462) (← links)
• Optimal sequential inspection policies (Q646686) (← links)
• Linear time algorithms for some separable quadratic programming problems (Q688207) (← links)
• A multi-criteria approach to approximate solution of multiple-choice knapsack problem (Q721960) (← links)
• Finding an Euclidean anti-\(k\)-centrum location of a set of points (Q732894) (← links)
• Solving the linear multiple choice knapsack problem with two objectives: Profit and equity (Q839491) (← links)
• Stop location design in public transportation networks: covering and accessibility objectives (Q845574) (← links)
• A faster polynomial algorithm for the unbalanced Hitchcock transportation problem (Q1003485) (← links)
• Up- and downgrading the 1-center in a network (Q1026756) (← links)
• Optimal algorithms for the path/tree-shaped facility location problems in trees (Q1031869) (← links)
• New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems (Q1038094) (← links)
• A new Lagrangian relaxation approach to the generalized assignment problem (Q1088908) (← links)
• Median hyperplanes in normed spaces -- a survey (Q1281394) (← links)
• Solving restricted line location problems via a dual interpretation (Q1289029) (← links)
• A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources (Q1306364) (← links)
• A minimal algorithm for the multiple-choice knapsack problem (Q1388832) (← links)
• Improved algorithms for several network location problems with equality measures. (Q1408453) (← links)
• Continuous location of dimensional structures. (Q1410321) (← links)
• A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints (Q1433165) (← links)
• Worst-case analysis of the greedy algorithm for a generalization of the maximum \(p\)-facility location problem (Q1577475) (← links)
• Exact approaches for the knapsack problem with setups (Q1652523) (← links)
• The nestedness property of location problems on the line (Q1667399) (← links)
• Revisiting \(k\)-sum optimization (Q1675256) (← links)
• The linear multiple choice knapsack problem (Q1825130) (← links)
• Minimizing the sum of the \(k\) largest functions in linear time. (Q1853685) (← links)
• A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks (Q1885943) (← links)
• A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
• Generalized penalty for circular coordinate representation (Q2072668) (← links)
• Optimal deterministic and robust selection of electricity contracts (Q2124812) (← links)
• Multiple-choice knapsack constraint in graphical models (Q2170205) (← links)
• An algorithm for the polyhedral cycle cover problem with constraints on the number and length of cycles (Q2185648) (← links)
• A relative robust approach on expected returns with bounded CVaR for portfolio selection (Q2239973) (← links)
• SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing (Q2242373) (← links)
• A linear-time algorithm for solving continuous maximin knapsack problems (Q2277359) (← links)
• Locating a median line with partial coverage distance (Q2349526) (← links)
• On the planar piecewise quadratic 1-center problem (Q2379920) (← links)
• An optimal randomized algorithm for \(d\)-variate zonoid depth (Q2477199) (← links)
• One-way and round-trip center location problems (Q2568335) (← links)