The following pages link to Savelsbergh, Martin W. P. (Q163010):
Displaying 50 items.
- (Q210502) (redirect page) (← links)
- (Q229636) (redirect page) (← links)
- Incremental network design with shortest paths (Q296857) (← links)
- The \(L\)-shape search method for triobjective integer programming (Q298165) (← links)
- The bi-objective mixed capacitated general routing problem with different route balance criteria (Q322701) (← links)
- A decision support tool for generating shipping data for the Hunter Valley coal chain (Q337259) (← links)
- Pricing for production and delivery flexibility in single-item lot-sizing (Q339714) (← links)
- Creating schedules and computing operating costs for LTL load plans (Q340230) (← links)
- A reclaimer scheduling problem arising in coal stockyard management (Q341465) (← links)
- (Q495938) (redirect page) (← links)
- Boosting the feasibility pump (Q495939) (← links)
- A branch-and-price guided search approach to maritime inventory routing (Q502460) (← links)
- Incremental network design with maximum flows (Q726224) (← links)
- Restrict-and-relax search for 0-1 mixed-integer programs (Q743638) (← links)
- Integer-programming software systems (Q817202) (← links)
- Approximating the stability region for binary mixed-integer programs (Q833592) (← links)
- Delivery strategies for blood products supplies (Q841585) (← links)
- Shipper collaboration (Q858256) (← links)
- Analysis of bounds for a capacitated single-item lot-sizing problem (Q858280) (← links)
- Inventory routing with continuous moves (Q858281) (← links)
- A classification scheme for vehicle routing and scheduling problems (Q913648) (← links)
- An efficient implementation of local search algorithms for constrained routing problems (Q918421) (← links)
- Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements (Q924628) (← links)
- Vendor managed inventory for environments with stochastic product usage (Q1040988) (← links)
- Edge exchanges in the degree-constrained minimum spanning tree problem (Q1086497) (← links)
- MINTO, a Mixed INTeger Optimizer (Q1331882) (← links)
- The relation of time indexed formulations of single machine scheduling problems to the node packing problem (Q1396279) (← links)
- On the polyhedral structure of a multi-item production planning model with setup times (Q1411623) (← links)
- A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case (Q1411630) (← links)
- Bidirected and unidirected capacity installation in telecommunication networks. (Q1417563) (← links)
- On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra (Q1580978) (← links)
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs (Q1586209) (← links)
- A polyhedral approach to single-machine scheduling problems. (Q1586211) (← links)
- Polyhedral results for the edge capacity polytope. (Q1611010) (← links)
- Dealing with demand uncertainty in service network and load plan design (Q1626706) (← links)
- A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem (Q1626744) (← links)
- A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints (Q1652440) (← links)
- Enhancing urban mobility: integrating ride-sharing and public transit (Q1652499) (← links)
- Nondominated Nash points: application of biobjective mixed integer programming (Q1653352) (← links)
- (Q1694818) (redirect page) (← links)
- Adaptive kernel search: a heuristic for solving mixed integer linear programs (Q1694819) (← links)
- Scheduling reclaimers serving a stock pad at a coal terminal (Q1707674) (← links)
- The generalized independent set problem: polyhedral analysis and solution approaches (Q1753398) (← links)
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs (Q1753507) (← links)
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program (Q1753509) (← links)
- Complexity of routing problems with release dates and deadlines (Q1754053) (← links)
- Preprocessing and cut generation techniques for multi-objective binary programming (Q1755381) (← links)
- Truck driver scheduling in Australia (Q1762092) (← links)
- Sequential and parallel local search for the time-constrained traveling salesman problem (Q1803676) (← links)
- Efficient feasibility testing for dial-a-ride problems (Q1866982) (← links)