The following pages link to (Q3751378):
Displaying 19 items.
- Tight bounds for online class-constrained packing (Q596145) (← links)
- The selective travelling salesman problem (Q910347) (← links)
- An exact algorithm for large unbounded knapsack problems (Q913659) (← links)
- Qos-aware service evaluation and selection (Q932236) (← links)
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes (Q951099) (← links)
- A new dominance procedure for combinatorial optimization problems (Q1109683) (← links)
- A multi-product loading problem: A model and solution method (Q1278990) (← links)
- An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks (Q1370664) (← links)
- An expanding-core algorithm for the exact \(0-1\) knapsack problem (Q1390271) (← links)
- An incentive dynamic programming method for the optimization of scholarship assignment (Q1727142) (← links)
- The linear complementarity problem as a separable bilinear program (Q1804582) (← links)
- A typology of cutting and packing problems (Q1825761) (← links)
- Options as silver bullets: valuation of term loans, inventory management, emissions trading and insurance risk mitigation using option theory (Q2171344) (← links)
- Optimal experimental design for combinatorial problems (Q2365318) (← links)
- Computational complexity analysis of set membership identification of Hammerstein and Wiener systems (Q2390559) (← links)
- Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls (Q2496024) (← links)
- Tree knapsack approaches for local access network design (Q2503262) (← links)
- A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances (Q2629710) (← links)
- Automated QoS-aware service selection based on soft constraints (Q6562519) (← links)
