Nathan Lane accepts the award for best revival of a play for Arthur Miller's “Death of a Salesman” at the Tony Awards in New York on Sunday. (Brendan McDermid/Reuters) NEW YORK — Seven times a week, ...

Add Yahoo as a preferred source to see more of our stories on Google. Image Credit: hellopakistan/Instagram. John Lithgow turned the 2026 Tony Awards into a career ...

“Ragtime” won best musical revival, while “Death of a Salesman” led with six prizes. Joshua Henry, Caissie Levy, John Lithgow and Laurie Metcalf were among the winners. Michael Paulson “Death of a ...

This is read by an automated voice. Please report any issues or inconsistencies here. See more from the L.A. Times in Google Search. Set us as preferred Joe Mantello’s revelatory revival of Arthur ...

Add Yahoo as a preferred source to see more of our stories on Google. The show that has had everyone clamoring for tickets this spring, Joe Mantello’s cobweb-clearing production of Arthur Miller’s ...

Broadway's current revival of Arthur Miller's Death of a Salesman was crowned the season's Best Revival of a Play at the 2026 Tony Awards June 7 at Radio City Music Hall. The play went into the night ...

Joe Mantello's acclaimed Broadway production of Arthur Miller's DEATH OF A SALESMAN has won the 2026 Tony Award for Best Revival of a Play. The production picked up several Tonys win at this year's ...

Laurie Metcalf recently starred in another of this year's nominated productions, Samuel D. Hunter’s LITTLE BEAR RIDGE ROAD. The beloved actor is already a two-time Tony Award winner, having earned ...

The Broadway revival of “Salesman” led with six Tony Awards. “Schmigadoon!” won best new musical, and “Ragtime” and “Liberation” also took home major prizes. By Michael Paulson “Schmigadoon!,” a ...

Abstract: The Traveling Salesman Problem (TSP) is a famous combinatorial optimization problem. Recent research has proposed an anchor-based supervised learning approach. This approach predicts ...

Abstract: The Traveling Salesman Problem (TSP) is one of the most well-known NP-hard combinatorial optimization problems (COPs). Many social production problems can be effectively represented as ...