The following pages link to (Q3993418):
Displaying 50 items.
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs (Q1753510) (← links)
- A population-based fast algorithm for a billion-dimensional resource allocation problem with integer variables (Q1753593) (← links)
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems (Q1754107) (← links)
- A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints (Q1754206) (← links)
- The load planning problem for double-stack intermodal trains (Q1754216) (← links)
- Lower bounds for a bin packing problem with linear usage cost (Q1755229) (← links)
- Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
- A generalized bin packing problem for parcel delivery in last-mile logistics (Q1755394) (← links)
- A constructive periodicity bound for the unbounded knapsack problem (Q1758270) (← links)
- An incomplete \(m\)-exchange algorithm for solving the large-scale multi-scenario knapsack problem (Q1761118) (← links)
- Solving market split problems with heuristical lattice reduction (Q1761840) (← links)
- Special issue on knapsack problems and applications (Q1761935) (← links)
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (Q1761941) (← links)
- Solving knapsack problems on GPU (Q1761942) (← links)
- Exact algorithms for the two-dimensional guillotine knapsack (Q1761943) (← links)
- A knapsack problem as a tool to solve the production planning problem in small foundries (Q1761949) (← links)
- A fuzzy DEA and knapsack formulation integrated model for project selection (Q1761956) (← links)
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem (Q1761969) (← links)
- Greedy algorithms for a class of knapsack problems with binary weights (Q1761999) (← links)
- Shift-and-merge technique for the DP solution of the time-constrained backpacker problem (Q1762021) (← links)
- Synchronized arc routing for snow plowing operations (Q1762132) (← links)
- Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm (Q1762137) (← links)
- Heuristics and lower bounds for the bin packing problem with conflicts (Q1765544) (← links)
- A branch and cut algorithm for hub location problems with single assignment (Q1771311) (← links)
- Where are the hard knapsack problems? (Q1772862) (← links)
- Optimal parallel machines scheduling with availability constraints (Q1775061) (← links)
- Improved results on the 0--1 multidimensional knapsack problem (Q1776956) (← links)
- A cutting stock problem and its solution in the manufacturing industry of large electric generators (Q1777147) (← links)
- A dual heuristic for mixed integer programming (Q1785392) (← links)
- Orbital shrinking: theory and applications (Q1786877) (← links)
- Hybrid genetic algorithms with selective crossover for the capacitated \(p\)-Median problem (Q1788935) (← links)
- Detection of local tourism systems by threshold accepting (Q1789564) (← links)
- A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming (Q1789641) (← links)
- Dichotomous binary differential evolution for knapsack problems (Q1793333) (← links)
- Optimization algorithms for the disjunctively constrained knapsack problem (Q1797814) (← links)
- Efficient reformulation for 0-1 programs -- methods and computational results (Q1803672) (← links)
- Extensions to the generalised assignment heuristic for vehicle routing (Q1806768) (← links)
- Lagrangean/surrogate relaxation for generalized assignment problems (Q1809834) (← links)
- Two-dimensional packing problems: a survey (Q1847188) (← links)
- LP models for bin packing and cutting stock problems (Q1847189) (← links)
- Heuristic algorithms for the three-dimensional bin packing problem (Q1847192) (← links)
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths (Q1847193) (← links)
- Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths (Q1847195) (← links)
- Modeling multistage cutting stock problems (Q1847197) (← links)
- A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry (Q1847199) (← links)
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems (Q1866008) (← links)
- Approximation algorithms for fractional knapsack problems (Q1866996) (← links)
- Stock selection heuristics for interdependent items (Q1869495) (← links)
- Optimisation of the interconnecting network of a UMTS radio mobile telephone system (Q1869690) (← links)
- Dual-based heuristics for a hierarchical covering location problem (Q1869894) (← links)
