The following pages link to Paolo Detti (Q336503):
Displaying 32 items.
- Optimal radio resources and transmission formats assignment in OFDMA systems (Q336504) (← links)
- Optimal packet-to-slot assignment in mobile telecommunications (Q833596) (← links)
- Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions (Q835601) (← links)
- Sequencing unreliable jobs on parallel machines (Q835638) (← links)
- Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems (Q880502) (← links)
- A lower bound on the Hamiltonian path completion number of a line graph (Q902504) (← links)
- Radio resource allocation problems for OFDMA cellular systems (Q960406) (← links)
- A polynomial algorithm for the multiple knapsack problem with divisible item sizes (Q987829) (← links)
- On dual based lower bounds for the sequential ordering problem with precedences and due dates (Q1417775) (← links)
- A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. (Q1427178) (← links)
- Process selection and sequencing in a two-agents production system (Q1432015) (← links)
- (Q1599323) (redirect page) (← links)
- Set-up coordination between two stages of a supply chain (Q1599325) (← links)
- A linear algorithm for the Hamiltonian completion number of the line graph of a tree (Q1603430) (← links)
- Scheduling nonpreemptive jobs on parallel machines subject to exponential unrecoverable interruptions (Q1652152) (← links)
- Robust single machine scheduling with a flexible maintenance activity (Q1738814) (← links)
- A MILP model for biological sample transportation in healthcare (Q2216003) (← links)
- The list scheduling algorithm for scheduling unreliable jobs on two parallel machines (Q2448904) (← links)
- Local search algorithms for finding the Hamiltonian completion number of line graphs (Q2468757) (← links)
- Packet scheduling in third-generation mobile systems with UTRA-TDD air interface (Q2480204) (← links)
- A bi-objective coordination setup problem in a two-stage production system (Q2482750) (← links)
- A new upper bound for the multiple knapsack problem (Q2668625) (← links)
- Replication and sequencing of unreliable jobs on parallel machines (Q2669802) (← links)
- Mathematical programming formulations and metaheuristics for biological sample transportation problems in healthcare (Q2676325) (← links)
- Optimal power control in OFDMA cellular networks (Q3008916) (← links)
- Solving Graph Partitioning Problems Arising in Tagless Cache Management (Q3195315) (← links)
- Minimum Dominating Trail Set for Two-Terminal Series Parallel Graphs (Q3439140) (← links)
- A branch and bound algorithm for the minimum storage-time sequencing problem (Q4434517) (← links)
- (Q4786489) (← links)
- (Q5708532) (← links)
- Solving crop planning and rotation problems in a sustainable agriculture perspective (Q6047856) (← links)
- A new upper bound for the multiple knapsack problem (Q6350846) (← links)
