The following pages link to (Q3993418):
Displaying 50 items.
- A fuzzy multidimensional multiple-choice knapsack model for project portfolio selection using an evolutionary algorithm (Q363591) (← links)
- Motion planning with pulley, rope, and baskets (Q385498) (← links)
- Adaptivity in the stochastic blackjack knapsack problem (Q385968) (← links)
- Minimum and worst-case performance ratios of rollout algorithms (Q415370) (← links)
- Procedures for the time and space constrained assembly line balancing problem (Q421558) (← links)
- Tight bounds for periodicity theorems on the unbounded knapsack problem (Q421659) (← links)
- The stochastic generalized bin packing problem (Q423955) (← links)
- A simulated annealing hyper-heuristic methodology for flexible decision support (Q427562) (← links)
- On the extremality of maximal dual feasible functions (Q433834) (← links)
- A hybrid branch-and-bound and evolutionary approach for allocating strings of applications to heterogeneous distributed computing systems (Q436728) (← links)
- Two heuristic solution concepts for the vehicle selection problem in line haul transports (Q439400) (← links)
- A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size (Q439486) (← links)
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- A multi-period renewal equipment problem (Q439598) (← links)
- A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems (Q443043) (← links)
- Inverse 1-median problem on trees under weighted Hamming distance (Q445338) (← links)
- Some efficiently solvable problems over integer partition polytopes (Q476314) (← links)
- Optimal and efficient adaptation in distributed real-time systems with discrete rates (Q483961) (← links)
- Essential particle swarm optimization queen with tabu search for MKP resolution (Q488403) (← links)
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem (Q490197) (← links)
- Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items (Q490206) (← links)
- Analysis of fitness landscape modifications in evolutionary dynamic optimization (Q507753) (← links)
- Heuristics for the general multiple non-linear knapsack problem (Q510935) (← links)
- Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams (Q512990) (← links)
- Multiple criteria dynamic programming and multiple knapsack problem (Q529961) (← links)
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem (Q531429) (← links)
- Relaxations and exact solution of the variable sized bin packing problem (Q535302) (← links)
- Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems (Q537958) (← links)
- Optimization models for targeted offers in direct marketing: exact and heuristic algorithms (Q541729) (← links)
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem (Q542002) (← links)
- On the exact separation of mixed integer knapsack cuts (Q543396) (← links)
- Unbounded knapsack problems with arithmetic weight sequences (Q545110) (← links)
- A branch-and-bound algorithm for hard multiple knapsack problems (Q545544) (← links)
- Optimal partial hedging in a discrete-time market as a Knapsack problem (Q607677) (← links)
- Reoptimizing the 0-1 knapsack problem (Q608266) (← links)
- Space and time allocation in a shipyard assembly hall (Q610963) (← links)
- A piecewise linearization for retail shelf space allocation problem and a local search heuristic (Q610971) (← links)
- A new destructive bounding scheme for the bin packing problem (Q610978) (← links)
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (Q610980) (← links)
- A survey of dual-feasible and superadditive functions (Q610986) (← links)
- Nature inspired genetic algorithms for hard packing problems (Q610991) (← links)
- Routing problems with loading constraints (Q610992) (← links)
- Strong formulation for the spot 5 daily photograph scheduling problem (Q613663) (← links)
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462) (← links)
- Inverse median location problems with variable coordinates (Q623783) (← links)
- A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem (Q632643) (← links)
- Global optimality conditions and optimization methods for quadratic knapsack problems (Q658556) (← links)
- Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution (Q664176) (← links)
- An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics (Q670759) (← links)
- The cardinality and precedence constrained maximum value sub-hypergraph problem and its applications (Q678869) (← links)
