scientific article; zbMATH DE number 1219584
From MaRDI portal
Publication:4217266
approximation algorithmbranch-and-bound algorithmflowinteger linear programmingNP-completenessoptimizationprimal-dual algorithmspanning tree
Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Deterministic network models in operations research (90B10) Linear programming (90C05) Integer programming (90C10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Optimality conditions and duality in mathematical programming (90C46) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
Cited in
(only showing first 100 items - show all)- The k-assignment polytope
- A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
- Optimization of a peer-to-peer system for efficient content replication
- The minimum spanning tree problem with fuzzy costs
- Probabilistic weak simulation is decidable in polynomial time
- Joint object placement and node dimensioning for internet content distribution
- The bandpass problem: Combinatorial optimization and library of problems
- Choosing robust solutions in discrete optimization problems with fuzzy costs
- Some methods for evaluating the optimality of elements in matroids with ill-known weights
- Interval-parameter optimization problems on graphs
- The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
- Persistency in maximum cardinality bipartite matchings
- A linear programming approach to reasoning about probabilities
- A new extension of local search applied to the Dial-A-Ride problem
- A new neighborhood structure for round robin scheduling problems
- Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling
- Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics
- Ensemble clustering using factor graph
- On imposing connectivity constraints in integer programs
- A novel probabilistic clustering model for heterogeneous networks
- Inductive synthesis of cover-grammars with the help of ant colony optimization
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
- Kernel technology to solve discrete optimization problems
- On the complexity of clustering with relaxed size constraints in fixed dimension
- Clustering Boolean tensors
- An algorithm for curve identification in the presence of curve intersections
- Anomalous scaling of the optimal cost in the one-dimensional random assignment problem
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
- The generalized vertex cover problem and some variations
- Quantitative evaluation of time-dependent Petri nets and applications to biochemical networks
- Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion
- Parallel machine scheduling with nested processing set restrictions and job delivery times
- Solving a real constraint satisfaction model for the university course timetabling problem: a case study
- Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions.
- A least-squares primal-dual algorithm for solving linear programming problems
- Max-algebra: The linear algebra of combinatorics?
- A pseudo-polynomial algorithm for optimal capacitor placement on electric power distribution networks
- LLL-reduction for integer knapsacks
- Integer points in knapsack polytopes and s-covering radius
- A linear assignment approach for the least-squares protein morphing problem
- Transfer affinity propagation-based clustering
- Steady states in the scheduling of discrete-time systems
- An NP-completeness result of edge search in graphs
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- An efficient algorithm for deciding vanishing of Schubert polynomial coefficients
- Solving interval linear least squares problems by PPS-methods
- Scheduling jobs with release and delivery times subject to nested eligibility constraints
- A triangulation and fill-reducing initialization procedure for the simplex algorithm
- Approximation algorithms for solving the line-capacitated minimum Steiner tree problem
- A time-triggered dimension reduction algorithm for the task assignment problem
- Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
- Short-term scheduling of production fleets in underground mines using CP-based LNS
- Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty
- Efficient algorithms for scheduling parallel jobs with interval constraints in clouds
- Evolutionary operators for the Hamiltonian completion problem
- Classes of linear programs solvable by coordinate-wise minimization
- On the implementation of a global optimization method for mixed-variable problems
- Approximating combinatorial optimization problems with the ordered weighted averaging criterion
- Scheduling jobs with sizes and delivery times on identical parallel batch machines
- Contention-resolving model predictive control for coupled control systems with a shared resource
- Probably partially true: satisfiability for Łukasiewicz infinitely-valued probabilistic logic and related topics
- Integer programming ensemble of temporal relations classifiers
- Topologically trivial closed walks in directed surface graphs
- The big-M method with the numerical infinite M
- Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance
- The stable marriage problem: an interdisciplinary review from the physicist's perspective
- Combinatorial two-stage minmax regret problems under interval uncertainty
- Thresholds for extreme orientability
- The component model for elementary landscapes and partial neighborhoods
- Approximation algorithms for constructing some required structures in digraphs
- No sublogarithmic-time approximation scheme for bipartite vertex cover
- A randomized algorithm for the min-Max selecting items problem with uncertain weights
- Good (K-means) clusterings are unique (up to small perturbations)
- Efficient generation of performance bounds for a class of traffic scheduling problems
- Selection of priority areas in research and development
- Bundling all shortest paths
- A note on submodularity preserved involving the rank functions
- Exact computation of censored least absolute deviations estimator
- Optimizing MSE for clustering with balanced size constraints
- Optimization and sustainable development
- The fastest itinerary in time-dependent decentralized travel information systems
- On stability of discrete-time switched systems
- Using expert knowledge in solving the seismic inverse problem
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
- Maximum margin partial label learning
- Parallel batch scheduling with nested processing set restrictions
- Motion planning algorithms for the Dubins Travelling Salesperson Problem
- Recoverable robust spanning tree problem under interval uncertainty representations
- Robust recoverable and two-stage selection problems
- Global discriminative-based nonnegative spectral clustering
- Approximations for two variants of the Steiner tree problem in the Euclidean plane \(\mathbb R^2\)
- Consistency checking and querying in probabilistic databases under integrity constraints
- Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices
- Coupled map lattices as spatio-temporal fitness functions: Landscape measures and evolutionary optimization
- Logistics scheduling with batching and transportation
- Sources of complexity in subset choice
- The complexity of maximum matroid--greedoid intersection and weighted greedoid maximiza\-tion
- Safe projections of binary data sets
- Church's thesis meets the \(N\)-body problem
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 Q4217266)
