scientific article
From MaRDI portal
Publication:3813613
zbMath0662.90065MaRDI QIDQ3813613
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
traveling salesmanheuristicperfect matchingpolyhedral combinatoricspolynomial-time algorithmssystem of linear inequalities
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Polytopes and polyhedra (52Bxx)
Related Items (36)
Application of the facility location problem to the problem of locating concentrators on an FAA microwave system ⋮ Optimal length resolution refutations of difference constraint systems ⋮ Computing a quasi-perfect equilibrium of a two-player game ⋮ Conic mixed-integer rounding cuts ⋮ Stability and stabilization of delay differential systems ⋮ Investment evaluation based on the commerical scope. The production of natural gas ⋮ On linear programming and matrix scaling over the algebraic numbers ⋮ Restricted robust uniform matroid maximization under interval uncertainty ⋮ On the complexity of quantified linear systems ⋮ Lifting, tilting and fractional programming revisited ⋮ SIRALINA: Efficient two-steps heuristic for storage optimisation in single period task scheduling ⋮ Integer programming models for round Robin tournaments ⋮ Improved algorithms for optimal length resolution refutation in difference constraint systems ⋮ Labelled Calculi for Łukasiewicz Logics ⋮ Proof search and co-NP completeness for many-valued logics ⋮ Analyzing fractional Horn constraint systems ⋮ Convex Hull of Arithmetic Automata ⋮ A combinatorial algorithm for Horn programs ⋮ A complexity perspective on entailment of parameterized linear constraints ⋮ On a decision procedure for quantified linear programs ⋮ Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints ⋮ An analysis of totally clairvoyant scheduling ⋮ An eigenstructure assignment approach for constrained linear continuous-time singular systems ⋮ A zero-space algorithm for negative cost cycle detection in networks ⋮ On integer points in polyhedra: A lower bound ⋮ The tropical analogue of the Helton-Nie conjecture is true ⋮ A polynomial time algorithm for Zero-Clairvoyant scheduling ⋮ Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices ⋮ A polynomial-time algorithm for computing the yolk in fixed dimension ⋮ Discrete convexity and equilibria in economies with indivisible goods and money ⋮ On integer closure in a system of unit two variable per inequality constraints ⋮ On the parametrized complexity of Read-once refutations in UTVPI+ constraint systems ⋮ Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization ⋮ A cutting plane algorithm for the unrelated parallel machine scheduling problem ⋮ \((A,B)\)-invariance conditions of polyhedral domains for continuous-time systems ⋮ Modelization of deterministic rational relations
This page was built for publication:
