The following pages link to (Q3993418):
Displaying 50 items.
- Bid evaluation in procurement auctions with piecewise linear supply curves (Q2573006) (← links)
- An ejection chain approach for the generalized assignment problem (Q2573015) (← links)
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (Q2576248) (← links)
- Fast lifting procedures for the bin packing problem (Q2581316) (← links)
- The capacitated centred clustering problem (Q2581607) (← links)
- Exact and heuristic algorithms for dynamic tree simplification (Q2583510) (← links)
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
- Solving a real-world train-unit assignment problem (Q2638371) (← links)
- Integer knapsack problems with set-up weights (Q2642635) (← links)
- On a nonseparable convex maximization problem with continuous Knapsack constraints (Q2643790) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem (Q2643948) (← links)
- A hybrid genetic algorithm for the two-dimensional single large object placement problem (Q2643949) (← links)
- The one dimensional Compartmentalised Knapsack problem: a case study (Q2643951) (← links)
- Computing the asymptotic worst-case of bin packing lower bounds (Q2643960) (← links)
- Accelerating column generation for variable sized bin-packing problems (Q2643963) (← links)
- An integrated cutting stock and sequencing problem (Q2643965) (← links)
- Optimising the cutting of wood fibre plates in the hardboard industry (Q2643972) (← links)
- A faster algorithm for the continuous bilevel knapsack problem (Q2661565) (← links)
- Lower and upper bounds for the non-linear generalized assignment problem (Q2664280) (← links)
- Multi-objective temporal bin packing problem: an application in cloud computing (Q2664301) (← links)
- A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games (Q2664449) (← links)
- Optimal strategy for solving a special case of the knapsack problem by the branch and bound method (Q2666932) (← links)
- A new upper bound for the multiple knapsack problem (Q2668625) (← links)
- A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems (Q2668700) (← links)
- Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727) (← links)
- Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning (Q2668752) (← links)
- Reinforcement learning for combinatorial optimization: a survey (Q2669503) (← links)
- The replenishment problem with multiple articles and an order threshold (Q2669586) (← links)
- Cover by disjoint cliques cuts for the knapsack problem with conflicting items (Q2670441) (← links)
- Optimal selection of touristic packages based on user preferences during sports mega-events (Q2672108) (← links)
- Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems (Q2674191) (← links)
- Capacitated clustering problems applied to the layout of IT-teams in software factories (Q2675719) (← links)
- Exact solution of network flow models with strong relaxations (Q2689828) (← links)
- Solving TSP through the integration of OR and CP techniques (Q2741259) (← links)
- Dual inequalities for stabilized column generation revisited (Q2806874) (← links)
- Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes (Q2817835) (← links)
- Optimization-based very large-scale neighborhood search for generalized assignment problems with location/allocation considerations (Q2830959) (← links)
- Exact solution methods for a generalized assignment problem with location/allocation considerations (Q2830960) (← links)
- A computational study of lower bounds for the two dimensional bin packing problem (Q2861507) (← links)
- Spanning trees with node degree cependent costs and knapsack reformulations (Q2861520) (← links)
- Memory and Learning in Metaheuristics (Q2866122) (← links)
- A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem (Q2883626) (← links)
- Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem (Q2892146) (← links)
- An Introduction to Geometric Semantic Genetic Programming (Q2958226) (← links)
- A Dynamic Programming Heuristic for the Quadratic Knapsack Problem (Q2967622) (← links)
- The Unbounded Knapsack Problem (Q2971610) (← links)
- Optimized general sparse grid approximation spaces for operator equations (Q3055197) (← links)
- Capacity allocation problem in flexible manufacturing systems: branch and bound based approaches (Q3055267) (← links)
- A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem (Q3057103) (← links)
