The following pages link to (Q4079613):
Displayed 50 items.
- Algebraic simplex initialization combined with the nonfeasible basis method (Q319588) (← links)
- Solving hard control problems in voting systems via integer programming (Q322433) (← links)
- An exact approach for maximizing the lifetime of sensor networks with adjustable sensing ranges (Q339664) (← links)
- New characterizations for largeness of the core (Q380864) (← links)
- Coping with selfish on-going behaviors (Q418112) (← links)
- Connectivity-and-hop-constrained design of electricity distribution networks (Q439454) (← links)
- On a constant factor approximation for minmax regret problems using a symmetry point scenario (Q439704) (← links)
- Certifying algorithms (Q465678) (← links)
- A reduction approach to the repeated assignment problem (Q531433) (← links)
- A review of multiobjective programming and its application in quantitative psychology (Q645494) (← links)
- A general framework for explaining the results of a multi-attribute preference model (Q646550) (← links)
- Computing regions of attraction with polytopes: Planar case (Q675285) (← links)
- The complexity of querying indefinite data about linearly ordered domains (Q676427) (← links)
- Measuring the distance between time series (Q678328) (← links)
- A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis (Q697556) (← links)
- Scheduling and constraint propagation (Q697570) (← links)
- Assignment games satisfy the CoMa-property (Q700114) (← links)
- An improved approximation algorithm for the partial Latin square extension problem. (Q703265) (← links)
- The sagitta method for solving linear programs (Q703904) (← links)
- Algorithms for the one-dimensional two-stage cutting stock problem (Q724047) (← links)
- LP narrowing: A new strategy for finding all solutions of nonlinear equations (Q732502) (← links)
- Binary linear programming solutions and non-approximability for control problems in voting systems (Q741772) (← links)
- Automating the Knuth Bendix ordering (Q751830) (← links)
- The decomposition principle and algorithms for linear programming (Q806964) (← links)
- Combining probabilistic logic programming with the power of maximum entropy (Q814608) (← links)
- Beyond Moulin mechanisms (Q834858) (← links)
- Perfect matchings in uniform hypergraphs with large minimum degree (Q850084) (← links)
- The vehicle routing problem with flexible time windows and traveling times (Q860386) (← links)
- An elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions in nonlinear programming (Q869202) (← links)
- Canonical bases in linear programming (Q908850) (← links)
- Experiments with external pivoting (Q909578) (← links)
- Inverse problems in fractal construction: Moment method solution (Q917117) (← links)
- A geometric consistency theorem for a symbolic perturbation scheme (Q918201) (← links)
- Identifying the optimal partition in convex quadratic programming (Q924889) (← links)
- Clique partitions of distance multigraphs (Q932596) (← links)
- Efficient nested pricing in the simplex algorithm (Q943787) (← links)
- On the complexity of bandwidth allocation in radio networks (Q952444) (← links)
- An algorithm for computing simple \(k\)-factors (Q987840) (← links)
- Sensitivity analysis and optimal ultimately stationary deterministic policies in some constrained discounted cost models (Q992043) (← links)
- A compact formulation of the ring loading problem with integer demand splitting (Q1015309) (← links)
- Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers (Q1025479) (← links)
- On strata of degenerate polyhedral cones. I: Condition and distance to strata (Q1027575) (← links)
- Influence graphs and the generalized finite difference method (Q1033552) (← links)
- On the complexity of a pivot step of the revised simplex algorithm (Q1068713) (← links)
- A new family of exponential LP problems (Q1097169) (← links)
- On the constrained linear least-squares problem: A personal view (Q1099928) (← links)
- Optimal lot streaming for multiple products in a two-machine flow shop (Q1127157) (← links)
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem (Q1127211) (← links)