Pages that link to "Item:Q1388832"

The following pages link to A minimal algorithm for the multiple-choice knapsack problem (Q1388832):

Displaying 50 items.

• Matroid and knapsack center problems (Q300451) (← links)
• A branch-cut-and-price algorithm for the piecewise linear transportation problem (Q319653) (← links)
• Robust efficiency measures for linear knapsack problem variants (Q323349) (← links)
• A QoS-aware composition method supporting cross-platform service invocation in cloud environment (Q439983) (← links)
• Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems (Q537958) (← links)
• Optimal sequential inspection policies (Q646686) (← links)
• A multi-criteria approach to approximate solution of multiple-choice knapsack problem (Q721960) (← links)
• The linking set problem: a polynomial special case of the multiple-choice knapsack problem (Q844527) (← links)
• A generalization of column generation to accelerate convergence (Q847856) (← links)
• Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm (Q894546) (← links)
• Qos-aware service evaluation and selection (Q932236) (← links)
• Efficient heuristic algorithms for path-based hardware/software partitioning (Q988463) (← links)
• A 0-1 knapsack model for evaluating the possible electoral college performance in two-party US presidential elections (Q1007645) (← links)
• Algorithmic aspects for power-efficient hardware/software partitioning (Q1010046) (← links)
• A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776) (← links)
• Knapsack problems with setups (Q1041933) (← links)
• Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core (Q1044419) (← links)
• Simple but efficient approaches for the collapsing knapsack problem (Q1364474) (← links)
• A minimal algorithm for the multiple-choice knapsack problem (Q1388832) (← links)
• Optimal bandwidth allocation for bandwidth adaptation in wireless multimedia networks. (Q1413821) (← links)
• Improved lower bounds for the capacitated lot sizing problem with setup times. (Q1417600) (← links)
• A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints (Q1433165) (← links)
• Integer optimization with penalized fractional values: the knapsack case (Q1631508) (← links)
• An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem (Q1683061) (← links)
• On the calculation of stability radius for multi-objective combinatorial optimization problems by inverse optimization (Q1935548) (← links)
• A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
• A genetic algorithm for the retail shelf space allocation problem with virtual segments (Q2150519) (← links)
• A stochastic approach to handle resource constraints as knapsack problems in ensemble pruning (Q2163207) (← links)
• SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing (Q2242373) (← links)
• On the importance of variability when managing metrology capacity (Q2282511) (← links)
• Solving the selective multi-category parallel-servicing problem (Q2341388) (← links)
• Power efficient uplink scheduling in SC-FDMA: benchmarking by column generation (Q2358072) (← links)
• An experimental study of random knapsack problems (Q2369879) (← links)
• Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context (Q2371346) (← links)
• A versatile algorithm for assembly line balancing (Q2383104) (← links)
• A cross entropy algorithm for the Knapsack problem with setups (Q2384601) (← links)
• Blessing of massive scale: spatial graphical model estimation with a total cardinality constraint approach (Q2425168) (← links)
• The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments (Q2445845) (← links)
• A best first search exact algorithm for the multiple-choice multidimensional knapsack problem (Q2467571) (← links)
• A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem (Q2496025) (← links)
• A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem (Q2506174) (← links)
• The one dimensional Compartmentalised Knapsack problem: a case study (Q2643951) (← links)
• An integrated cutting stock and sequencing problem (Q2643965) (← links)
• Single Commodity Stochastic Network Design Under Probabilistic Constraint with Discrete Random Variables (Q2797468) (← links)
• Hybrid approaches for the two-scenario max-min knapsack problem (Q2914199) (← links)
• An improved binary search algorithm for the Multiple-Choice Knapsack Problem (Q2954365) (← links)
• A DYNAMIC PROGRAMMING HEURISTIC FOR RETAIL SHELF SPACE ALLOCATION PROBLEM (Q2998842) (← links)
• A dynamic programming approach to the multiple-choice multi-period knapsack problem and the recursive APL2 code (Q3002339) (← links)
• A two-stage vehicle routing model for large-scale bioterrorism emergencies (Q3057125) (← links)
• Admission control in computer networks with uncertain parameters (Q3451512) (← links)