Parametric Combinatorial Computing and a Problem of Program Module Distribution

DOI10.1145/2402.322391MaRDI QIDQ3765242zbMATH OpenOpenAlexFDO

Authors Dan Gusfield

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

zbMATH Keywords

parametric programmingcombinatorial computingratio optimizationdistributing modules of a computer program between two processorsparametric computing

Mathematics Subject Classification ID

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)

Cited in

(24)

• An efficient algorithm for the parametric resource allocation problem
• Generalization of a theorem on the parametric maximum flow problem
• Constructing the minimization diagram of a two-parameter problem
• Parametric methods in integer linear programming
• An algorithm for the multiparametric 0--1-integer linear programming problem relative to the objective function
• Transitions in geometric minimum spanning trees
• Strongly polynomial-time approximation for a class of bicriteria problems.
• The multi-weighted spanning tree problem
• Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
• Parametric multiple sequence alignment and phylogeny construction
• Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
• Possibilistic bottleneck combinatorial optimization problems with ill-known weights
• Parametric optimization of sequence alignment
• The economic lot-sizing problem with an emission capacity constraint
• Parametric stable marriage and minimum cuts
• Algorithms and complexity analysis for some flow problems
• Parametric problems on graphs of bounded tree-width
• Calculation of stability radii for combinatorial optimization problems
• Space-sweep algorithms for parametric optimization
• A note on Stability of the constant cost dynamic lot size model by K. Richter
• A survey of exact and approximation algorithms for linear-parametric optimization problems
• Analyse de sensibilité pour les problèmes linéaires en variables 0-1
• Using sparsification for parametric minimum spanning tree problems
• An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual

This page was built for publication: Parametric Combinatorial Computing and a Problem of Program Module Distribution

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