scientific article; zbMATH DE number 3247783

zbMATH Open0154.19506MaRDI QIDQ5534682FDOQ5534682

Authors: Michel Simonnard 

Publication date: 1966

Title of this publication is not available (Why is that?)

zbMATH Keywords

operations research

Cited In (30)

• Rational preemptive scheduling
• Another proof that assignment games have singleton cores only if multiple optimal matchings exist
• Evaluation of elastic moduli of composite materials by linear programming
• An algorithm for determining redundant inequalities and all solutions to convex polyhedra
• Ranked linear models and sequential patterns recognition
• On some relations between a dual pair of multiple objective linear programs
• A linear continuous transportation problem
• Mixed models, random utilities, and the triangle inequality
• An improved version of the out-of-kilter method and a comparative study of computer codes
• Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
• A linear and discrete programming framework for representing qualitative knowledge
• Variations on the theme of slacks-based measure of efficiency in DEA
• The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm
• Primal transportation and transshipment algorithms
• On the linear programming approach to the optimality property of Prokhorov's distance
• Some theoretical implications of local optimization
• Stochastische Transportprobleme
• Preemptive scheduling of interval orders is polynomial
• Cooperative games (von Neumann-Morgenstern stable sets)
• On the analysis of structural design
• An absolute-value linear programming problem
• Tools for reformulating logical forms into zero-one mixed integer programs
• Graphical analysis of duality and the Kuhn-Tucker conditions in linear programming
• An economic interpretation of duality in linear programming
• The complexity of routing in~hierarchical PNNI networks
• Conversion of programs between computers: Interpreters, simulators and compilers
• Discrete right hand side parametrization for linear integer programs
• Iterative decoding of linear codes by a modulo-2 linear program
• Some Results on Sparse Matrices
• Some NP-complete problems in linear programming

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5534682)