Parametric Combinatorial Computing and a Problem of Program Module Distribution
From MaRDI portal
Publication:3765242
DOI10.1145/2402.322391zbMath0628.68035OpenAlexW1971057413MaRDI QIDQ3765242
Publication date: 1983
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2402.322391
parametric programmingcombinatorial computingratio optimizationdistributing modules of a computer program between two processorsparametric computing
Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)
Related Items
Parametric optimization of sequence alignment ⋮ The economic lot-sizing problem with an emission capacity constraint ⋮ Using sparsification for parametric minimum spanning tree problems ⋮ Space-sweep algorithms for parametric optimization ⋮ Parametric problems on graphs of bounded tree-width ⋮ Constructing the minimization diagram of a two-parameter problem ⋮ Parametric methods in integer linear programming ⋮ Parametric multiple sequence alignment and phylogeny construction ⋮ Linear-time algorithms for parametric minimum spanning tree problems on planar graphs ⋮ The multi-weighted spanning tree problem ⋮ Possibilistic bottleneck combinatorial optimization problems with ill-known weights ⋮ Parametric stable marriage and minimum cuts ⋮ Transitions in geometric minimum spanning trees ⋮ Generalization of a theorem on the parametric maximum flow problem ⋮ Strongly polynomial-time approximation for a class of bicriteria problems. ⋮ Analyse de sensibilité pour les problèmes linéaires en variables 0-1 ⋮ Linear-time algorithms for parametric minimum spanning tree problems on planar graphs ⋮ An algorithm for the multiparametric 0--1-integer linear programming problem relative to the objective function ⋮ Calculation of stability radii for combinatorial optimization problems ⋮ An efficient algorithm for the parametric resource allocation problem ⋮ A note on Stability of the constant cost dynamic lot size model by K. Richter ⋮ Algorithms and complexity analysis for some flow problems ⋮ An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
