scientific article; zbMATH DE number 3497901

zbMath0318.05002MaRDI QIDQ4079613

No author found.

Publication date: 1975

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Linear programming (90C05) Permutations, words, matrices (05A05)

Related Items

A timing model for the revised simplex method, Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications, 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\), Symbolic treatment of geometric degeneracies, The role of pivoting in proving some fundamental theorems of linear algebra, Testing probabilistic models of choice using column generation, Combinatorial redundancy detection, 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, Asymptotic multipartite version of the Alon-Yuster theorem, The \(s\)-monotone index selection rules for pivot algorithms of linear programming, Efficient Elimination of Redundancies in Polyhedra by Raytracing, On the characterization of weighted simple games, Optimising the distributed execution of join queries in polynomial time, The generic Gröbner walk, Higher-order multivariate Markov chains and their applications, Towards optimal and scalable solution for routing and spectrum allocation, Aggregating disparate estimates of chance, Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint, Robust multiclass kernel-based classifiers, Fast and efficient linear programming and linear least-squares computations, Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing, The complexity of scheduling TV commercials, Cycling in linear programming problems, Local optimality subsets and global optimization: A prospective approach, Refuting conjectures in extremal combinatorics via linear programming, Convexity and global optimization: A theoretical link, 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, Improved results on the 0--1 multidimensional knapsack problem, A method of transferring polyhedron between the intersection-form and the sum-form, Approximating and computing behavioural distances in probabilistic transition systems, Online searching with turn cost, 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 Novel Optimization in Guillotine Cut Applied Reel of Steel, 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, 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, Modeling multistage cutting stock problems, 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., 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 phase-1 approach for the generalized simplex algorithm, 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, Beyond Moulin mechanisms, A column generation approach to job grouping for flexible manufacturing systems, A new family of exponential LP problems, Analysis of linear structured systems using a primal-dual algorithm, Algebraic simplex initialization combined with the nonfeasible basis method, On the constrained linear least-squares problem: A personal view, Solving hard control problems in voting systems via integer programming, Perfect matchings in uniform hypergraphs with large minimum degree, 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 exact approach for maximizing the lifetime of sensor networks with adjustable sensing ranges, 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, Optimal lot streaming for multiple products in a two-machine flow shop, New characterizations for largeness of the core, CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem, A dual projective simplex method for linear programming, An integrated stock-bond portfolio optimization model, Coping with selfish on-going behaviors, An algorithm for simplex tableau reduction: The push-to-pull solution strategy, Canonical bases in linear programming, Experiments with external pivoting, Connectivity-and-hop-constrained design of electricity distribution networks, On a constant factor approximation for minmax regret problems using a symmetry point scenario, On duality theorems, The final NETLIB-LP results, Inverse problems in fractal construction: Moment method solution, A review of multiobjective programming and its application in quantitative psychology, A general framework for explaining the results of a multi-attribute preference model, A geometric consistency theorem for a symbolic perturbation scheme, Sparsest cuts and concurrent flows in product graphs., Identifying the optimal partition in convex quadratic programming, Certifying algorithms, An algorithm for disjunctive programs, An optimization approach to multiple sequence alignment, Perron eigenvectors and the symmetric transportation polytope, Clique partitions of distance multigraphs, 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, Efficient nested pricing in the simplex algorithm, Computing regions of attraction with polytopes: Planar case, The complexity of querying indefinite data about linearly ordered domains, Measuring the distance between time series, On the complexity of bandwidth allocation in radio networks, Partial maintainability and control in nonhomogeneous Markov manpower systems, Matching theory -- a sampler: From Dénes König to the present, A genuinely polynomial primal simplex algorithm for the assignment problem, A barrier method for dynamic Leontief-type linear programs, Sensitivity analysis for Horn formulae, Two strongly polynomial cut cancelling algorithms for minimum cost network flow, A reduction approach to the repeated assignment problem, 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, An algorithm for computing simple \(k\)-factors, Sensitivity analysis and optimal ultimately stationary deterministic policies in some constrained discounted cost models, Algorithms for the one-dimensional two-stage cutting stock problem, LP narrowing: A new strategy for finding all solutions of nonlinear equations, Binary linear programming solutions and non-approximability for control problems in voting systems, Algebraic languages for mathematical programming, A compact formulation of the ring loading problem with integer demand splitting, Automating the Knuth Bendix ordering, Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers, On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems, On strata of degenerate polyhedral cones. I: Condition and distance to strata, Influence graphs and the generalized finite difference method, A primal partitioning approach for single and non-simultaneous multicommodity flow problems, 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, 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, Simulated annealing for order spread minimization in sequencing cutting patterns, Extreme nonnegative matrices, Optimising the flow of information within a C3I network., The decomposition principle and algorithms for linear programming, Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set, Obtaining simultaneous solutions of linear subsystems of inequalities and duals, Row and column generation technique for a multistage cutting stock problem, On the complexity of a pivot step of the revised simplex algorithm, Enumerating extreme points of a highly degenerate polytope, Generating polynomial orderings, Probabilistic satisfiability with imprecise probabilities, Estimating the number of vertices of a polyhedron, Combining probabilistic logic programming with the power of maximum entropy, A proof of the convexity of the range of a nonatomic vector measure using linear inequalities