The following pages link to (Q4003376):
Displaying 15 items.
- Maximum likelihood genetic sequence reconstruction from oligo content (Q4305126) (← links)
- The out‐of‐kilter algorithm for solving network problems (Q4359664) (← links)
- An ε-Relaxation method for generalized separable convex cost network flow problems (Q4645915) (← links)
- THE ASSIGNMENT OF INDIVIDUAL RENEWABLE RESOURCES IN SCHEDULING (Q4650602) (← links)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)
- A truncated primal-infeasible dual-feasible network interior point method (Q4953319) (← links)
- Shortest path reoptimization vs resolution from scratch: a computational comparison (Q5043855) (← links)
- Mathematical Programs with Equilibrium Constraints: A Brief Survey of Methods and Optimality Conditions (Q5244682) (← links)
- The vehicle rescheduling problem: Model and algorithms (Q5434589) (← links)
- A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem (Q5931724) (← links)
- A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods (Q6160378) (← links)
- Branch-and-price based heuristic algorithm for fuzzy multi-depot bus scheduling problem (Q6535293) (← links)
- Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption (Q6547016) (← links)
- Projection methods for finding the greatest element of the intersection of max-closed convex sets (Q6638853) (← links)
- Nonsmooth projection-free optimization with functional constraints (Q6642795) (← links)
