The following pages link to Marco Trubian (Q340261):
Displaying 22 items.
- A branch and price algorithm for the SS/TDMA problem with cardinality constraint (Q340262) (← links)
- A column generation approach for multicast routing and wavelength assignment with delay constraints in heterogeneous WDM networks (Q490218) (← links)
- Joint admission control and resource allocation in virtualized servers (Q666077) (← links)
- SLA based resource allocation policies in autonomic environments (Q869386) (← links)
- An exact algorithm for the node weighted Steiner tree problem (Q876575) (← links)
- A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem (Q1130068) (← links)
- (Q1179433) (redirect page) (← links)
- Polymatroids: Construction and random algorithms (Q1179434) (← links)
- Data-dependent bounds for the General and the Asymmetric Stacker-Crane problems (Q1283797) (← links)
- Aggregate planning and scheduling in the food industry: A case study (Q1390328) (← links)
- New bounds for optimum traffic assignment in satellite communication. (Q1406681) (← links)
- A note on the approximation of the asymmetric traveling salesman problem. (Q1417511) (← links)
- Solution of large weighted equicut problems (Q1609912) (← links)
- Solving the feedback vertex set problem on undirected graphs (Q1975362) (← links)
- Column-generation based bounds for the homogeneous areas problem (Q2356280) (← links)
- Applying tabu search to the job-shop scheduling problem (Q2367003) (← links)
- Employee workload balancing by graph partitioning (Q2448894) (← links)
- A local-search-based heuristic for the demand-constrained multidimensional knapsack problem (Q2890459) (← links)
- Solving minimum K-cardinality cut problems in planar graphs (Q3418207) (← links)
- A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM (Q3526525) (← links)
- (Q4319398) (← links)
- Heuristics from Nature for Hard Combinatorial Optimization Problems (Q5690286) (← links)
