The following pages link to (Q4739657):
Displayed 50 items.
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities (Q139206) (← links)
- Heuristic solutions and confidence intervals for the multicovering problem (Q579132) (← links)
- A measure-theoretical max-flow-min-cut problem (Q583082) (← links)
- A simpler and faster algorithm for optimal total-work-content-power due data determination (Q583099) (← links)
- A dynamic location problem for graphs (Q583245) (← links)
- Cyclic orders (Q583246) (← links)
- Scheduling periodic events (Q584069) (← links)
- New crash procedures for large systems of linear constraints (Q584077) (← links)
- Graph properties checkable in linear time in the number of vertices (Q596315) (← links)
- Approximate solution of NP optimization problems (Q672315) (← links)
- The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate (Q672389) (← links)
- Scheduling on a single processor with variable speed (Q673343) (← links)
- Knapsack problems for NL (Q673615) (← links)
- Training digraphs (Q674181) (← links)
- Interval propagation to reason about sets: Definition and implementation of a practical language (Q679421) (← links)
- Dynamic algorithms for shortest paths in planar graphs (Q685367) (← links)
- A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
- Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices (Q687079) (← links)
- Approximation algorithms for indefinite quadratic programming (Q687094) (← links)
- A primal-dual simplex method for linear programs (Q688212) (← links)
- Complexity of unification problems with associative-commutative operators (Q688565) (← links)
- A generalized hypergreedy algorithm for weighted perfect matching (Q688623) (← links)
- A long-step barrier method for convex quadratic programming (Q689102) (← links)
- Geometric Knapsack problems (Q689105) (← links)
- On worst-case aggregation analysis for network location problems (Q689246) (← links)
- The generic canonical form of a regular structured matrix pencil (Q697066) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- Local ratio with negative weights. (Q703278) (← links)
- Block linear majorants in quadratic 0--1 optimization (Q705499) (← links)
- Resource allocation under limited sharing (Q750312) (← links)
- Making sparse matrices sparser: Computational results (Q751503) (← links)
- A level set algorithm for a class of reverse convex programs (Q751513) (← links)
- Active set algorithms for isotonic regression; a unifying framework (Q752010) (← links)
- Approximate algorithms for the Knapsack problem on parallel computers (Q757041) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Network models for vehicle and crew scheduling (Q792872) (← links)
- Certain NP-complete matching problems (Q794163) (← links)
- On monotonicity in the scaled potential algorithm for linear programming (Q805164) (← links)
- Theoretical efficiency of a shifted-barrier-function algorithm for linear programming (Q806962) (← links)
- On the regularity of matrices in min algebra (Q807718) (← links)
- Shortest paths without a map (Q809612) (← links)
- An algorithm of internal feasible directions for linear integer programming (Q809890) (← links)
- Note on solving linear complementarity problems as jointly constrained bilinear programs (Q809900) (← links)
- Completeness in approximation classes (Q811119) (← links)
- An extended ant colony algorithm and its convergence analysis (Q812977) (← links)
- The nucleolus of balanced simple flow networks (Q817277) (← links)
- Robust inference of trees (Q819944) (← links)
- Approximating the minimal sensor selection for supervisory control (Q853685) (← links)
- An algorithm for projective point matching in the presence of spurious points (Q854239) (← links)
- ILP approaches to the blockmodel problem (Q856277) (← links)