Publication:4079613
From MaRDI portal
zbMath0318.05002MaRDI QIDQ4079613
No author found.
Publication date: 1975
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
90C05: Linear programming
05A05: Permutations, words, matrices
Related Items
Computing regions of attraction with polytopes: Planar case, The complexity of querying indefinite data about linearly ordered domains, Measuring the distance between time series, A genuinely polynomial primal simplex algorithm for the assignment problem, Two strongly polynomial cut cancelling algorithms for minimum cost network flow, A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis, Scheduling and constraint propagation, Assignment games satisfy the CoMa-property, An improved approximation algorithm for the partial Latin square extension problem., The sagitta method for solving linear programs, Automating the Knuth Bendix ordering, The decomposition principle and algorithms for linear programming, Combining probabilistic logic programming with the power of maximum entropy, Perfect matchings in uniform hypergraphs with large minimum degree, The vehicle routing problem with flexible time windows and traveling times, An elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions in nonlinear programming, Canonical bases in linear programming, Experiments with external pivoting, Inverse problems in fractal construction: Moment method solution, A geometric consistency theorem for a symbolic perturbation scheme, Identifying the optimal partition in convex quadratic programming, Clique partitions of distance multigraphs, Efficient nested pricing in the simplex algorithm, On the complexity of bandwidth allocation in radio networks, On the complexity of a pivot step of the revised simplex algorithm, A new family of exponential LP problems, On the constrained linear least-squares problem: A personal view, Optimal lot streaming for multiple products in a two-machine flow shop, CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem, A dual projective simplex method for linear programming, On duality theorems, An algorithm for disjunctive programs, Perron eigenvectors and the symmetric transportation polytope, On anti-cycling pivoting rules for the simplex method, A basis enumeration algorithm for linear systems with geometric applications, Disturbance spaces and sup regulators in discrete time, Row-stochastic matrices with a common left fixed vector, Partial maintainability and control in nonhomogeneous Markov manpower systems, Matching theory -- a sampler: From Dénes König to the present, A barrier method for dynamic Leontief-type linear programs, Sensitivity analysis for Horn formulae, Algebraic languages for mathematical programming, On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems, On infeasibility of systems of convex analytic inequalities, Infeasibility analysis for systems of quadratic convex inequalities, Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem, Simulated annealing for order spread minimization in sequencing cutting patterns, Extreme nonnegative matrices, Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set, Enumerating extreme points of a highly degenerate polytope, Generating polynomial orderings, A proof of the convexity of the range of a nonatomic vector measure using linear inequalities, Weights improvement in column aggregation, Optimal distributed execution of join queries, Convex programs with an additional constraint on the product of several convex functions, Lower bounds on cube simplexity, Incorporating processor costs in optimizing the distributed execution of join queries, A column generation approach to job grouping for flexible manufacturing systems, Analysis of linear structured systems using a primal-dual algorithm, Fractional v. integral covers in hypergraphs of bounded edge size, How good are convex hull algorithms?, Minimizing the response time of executing a join between fragmented relations in a distributed database system, Minimizing a linear multiplicative-type function under network flow constraints, Schmidt-Mirsky matrix approximation with linearly constrained singular values, An integrated stock-bond portfolio optimization model, An algorithm for simplex tableau reduction: The push-to-pull solution strategy, The final NETLIB-LP results, Sparsest cuts and concurrent flows in product graphs., An optimization approach to multiple sequence alignment, A primal partitioning approach for single and non-simultaneous multicommodity flow problems, A new approach to cyclic ordering of 2D orientations using ternary relation algebras, On the properties of the subsets of a discrete domain defined by the local optimae of a function endowed with some geometrical properties, A tutorial history of least squares with applications to astronomy and geodesy, Optimising the flow of information within a C3I network., Obtaining simultaneous solutions of linear subsystems of inequalities and duals, Row and column generation technique for a multistage cutting stock problem, Probabilistic satisfiability with imprecise probabilities, Estimating the number of vertices of a polyhedron, A phase-1 approach for the generalized simplex algorithm, Cycling in linear programming problems, Improved results on the 0--1 multidimensional knapsack problem, Evaluating multiple join queries in a distributed database system, An identity for matching and skew-symmetric determinant, A basis-defiency-allowing variation of the simplex method for linear programming, A generalized dual phase-2 simplex algorithm., A logic for reasoning about probabilities, Fast finite methods for a system of linear inequalities, Efficient parallel linear programming, Least-cost partition algorithms, A generalization of Lévy's concentration-variance inequality, Modeling multistage cutting stock problems, Linearly constrained global optimization: a general solution algorithm with applications., An iterative working-set method for large-scale nonconvex quadratic programming, A heuristic for the continuous capacity and flow assignment, A note on tolerance graph recognition, An identity for bipartite matching and symmetric determinant, Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\), The propagation of updates to relational tables in a distributed database system, The implementation of linear programming algorithms based on homotopies, Genetic algorithms in constrained optimization, Local optimality subsets and global optimization: A prospective approach, Convexity and global optimization: A theoretical link, A method of transferring polyhedron between the intersection-form and the sum-form, Optimising the distributed execution of join queries in polynomial time, A timing model for the revised simplex method, Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications, The generic Gröbner walk, Higher-order multivariate Markov chains and their applications, Aggregating disparate estimates of chance, Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint, Robust multiclass kernel-based classifiers, Lagrangian duality applied to the vehicle routing problem with time windows, Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems, A procedure of Chvátal for testing feasibility in linear programming and matrix scaling, Approximating and computing behavioural distances in probabilistic transition systems, Online searching with turn cost, Models and algorithms for the screen line-based traffic-counting location problems, One-sided elasticities and technical efficiency in multi-output production: a theoretical framework, A computer implementation of the push-and-pull algorithm and its computational comparison with LP simplex method, Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem, An elementary digital plane recognition algorithm, Lot streaming for quality control in two-stage batch production, Normality of semigroups with some links to graph theory., Symbolic treatment of geometric degeneracies, The role of pivoting in proving some fundamental theorems of linear algebra, Fast and efficient linear programming and linear least-squares computations
