scientific article; zbMATH DE number 1302177
From MaRDI portal
Publication:4247444
zbMath0934.90059MaRDI QIDQ4247444
No author found.
Publication date: 19 April 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (14)
Emerging multiple issue e-auctions ⋮ Modeling the parallel machine scheduling problem with step deteriorating jobs ⋮ Heuristic algorithms for visiting the customers in a rolling schedule environment ⋮ Alternative formulations for the set packing problem and their application to the winner determination problem ⋮ On the parameterized complexity of compact set packing ⋮ A new approach for modeling and solving set packing problems ⋮ A biased random-key genetic algorithm for the Steiner triple covering problem ⋮ Exact and heuristic approaches for the set cover with pairs problem ⋮ Modelling transfer line design problem via a set partitioning problem ⋮ Discrete location problems with push-pull objectives ⋮ A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints ⋮ Requiring connectivity in the set covering problem ⋮ Dynamic node packing ⋮ Distributed algorithms for matching in hypergraphs
This page was built for publication:
