Pages that link to "Item:Q3688105"
From MaRDI portal
The following pages link to Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality (Q3688105):
Displaying 50 items.
- Capacity allocation problem with random demands for the rail container carrier (Q439359) (← links)
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems (Q443043) (← links)
- Essential particle swarm optimization queen with tabu search for MKP resolution (Q488403) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual (Q817197) (← links)
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm (Q894546) (← links)
- A surrogate and Lagrangian approach to constrained network problems (Q920831) (← links)
- A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles (Q941476) (← links)
- Bringing order into the neighborhoods: Relaxation guided variable neighborhood search (Q953317) (← links)
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem (Q960412) (← links)
- Analysis of maximum total return in the continuous knapsack problem with fuzzy object weights (Q965587) (← links)
- A multi-level search strategy for the 0-1 multidimensional knapsack problem (Q968116) (← links)
- NeuroGenetic approach for combinatorial optimization: an exploratory analysis (Q970182) (← links)
- A trust branching path heuristic for zero-one programming (Q1014935) (← links)
- Heuristics for the 0-1 multidimensional knapsack problem (Q1042198) (← links)
- An integer programming model for the allocation of databases in a distributed computer system (Q1083877) (← links)
- A simulated annealing approach to the multiconstraint zero-one knapsack problem (Q1099588) (← links)
- Surrogate duality in a branch-and-bound procedure for integer programming (Q1099783) (← links)
- An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem (Q1124717) (← links)
- Configuration of fully replicated distributed database system over wide area networks (Q1197781) (← links)
- A survey of algorithms for the generalized assignment problem (Q1199507) (← links)
- A contraction for the multiparametric integer linear programming problem (Q1278945) (← links)
- An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem (Q1309925) (← links)
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms) (Q1327232) (← links)
- Multiple-type, two-dimensional bin packing problems: Applications and algorithms (Q1339128) (← links)
- A surrogate heuristic for set covering problems (Q1342046) (← links)
- Optimization by ghost image processes in neural networks (Q1342097) (← links)
- Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach (Q1389081) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- An algorithm for the multiparametric 0--1-integer linear programming problem relative to the objective function (Q1578554) (← links)
- An algorithm for the multiparametric 0-1-integer linear programming problem relative to the constraint matrix (Q1591599) (← links)
- An algorithm to perform a complete parametric analysis relative to the constraint matrix for a 0-1-integer linear program (Q1600931) (← links)
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem (Q1609923) (← links)
- Bi-dimensional knapsack problems with one soft constraint (Q1652049) (← links)
- Improved results on the 0--1 multidimensional knapsack problem (Q1776956) (← links)
- A tabu search algorithm for the routing and capacity assignment problem in computer networks (Q1781553) (← links)
- Future paths for integer programming and links to artificial intelligence (Q1821034) (← links)
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems (Q1866008) (← links)
- An exact algorithm for bilevel 0-1 knapsack problems (Q1954852) (← links)
- Revisiting surrogate relaxation for the multidimensional knapsack problem (Q2102833) (← links)
- On generalized surrogate duality in mixed-integer nonlinear programming (Q2118119) (← links)
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem (Q2195439) (← links)
- Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems (Q2282492) (← links)
- Dynamic tabu list management using the reverse elimination method (Q2366993) (← links)
- Part type selection problem in flexible manufacturing systems: Tabu search algorithms (Q2367007) (← links)
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem (Q2433806) (← links)
- Solving the Knapsack problem with imprecise weight coefficients using genetic algorithms (Q2456412) (← links)
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)