The following pages link to P. Mirchandani (Q221932):
Displaying 22 items.
- An adaptive large neighborhood search heuristic for the electric vehicle scheduling problem (Q342549) (← links)
- The convex hull of two core capacitated network design problems (Q689128) (← links)
- Average performance of greedy heuristics for the integer knapsack problem. (Q1420409) (← links)
- Projections of the capacitated network loading problem (Q1577107) (← links)
- Designing hierarchical survivable networks (Q2781139) (← links)
- Bundling Strategies When Products Are Vertically Differentiated and Capacities Are Limited (Q3117338) (← links)
- The Minimum Satisfiability Problem (Q4296521) (← links)
- A Dual-Based Algorithm for Multi-Level Network Design (Q4302659) (← links)
- Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem (Q4319533) (← links)
- (Q4398375) (← links)
- Connectivity-splitting models for survivable network design (Q4446914) (← links)
- Optimal Network Design with End-to-End Service Requirements (Q4604906) (← links)
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem (Q4838244) (← links)
- (Q4887753) (← links)
- Capacitated Location Problems on a Line (Q4889778) (← links)
- Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models (Q5080634) (← links)
- Technical Note—New Results Concerning Probability Distributions with Increasing Generalized Failure Rates (Q5166257) (← links)
- Connectivity Upgrade Models for Survivable Network Design (Q5188992) (← links)
- Shortest paths, single origin‐destination network design, and associated polyhedra (Q5287444) (← links)
- Heuristics, LPs, and Trees on Trees: Network Design Analyses (Q5689795) (← links)
- The Multi-Tier Tree Problem (Q5690261) (← links)
- Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems (Q5952066) (← links)
