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 (only showing first 100 items - show all)

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

This page was built for publication: