Pages that link to "Item:Q403670"
From MaRDI portal
The following pages link to New approaches to multi-objective optimization (Q403670):
Displaying 34 items.
- The capacitated orienteering problem (Q496434) (← links)
- Methods for multi-objective optimization: an analysis (Q508908) (← links)
- Bi-objective matchings with the triangle inequality (Q515541) (← links)
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle (Q543415) (← links)
- A theory and algorithms for combinatorial reoptimization (Q1709582) (← links)
- Tour recommendation for groups (Q1741326) (← links)
- Multi-criteria approximation schemes for the resource constrained shortest path problem (Q1749776) (← links)
- Connectivity interdiction (Q1785279) (← links)
- Approximate Pareto sets of minimal size for multi-objective optimization problems (Q1785308) (← links)
- Approximating MIN-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems (Q1800987) (← links)
- One-exact approximate Pareto sets (Q2038919) (← links)
- Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects (Q2060557) (← links)
- Socially fair network design via iterative rounding (Q2084030) (← links)
- Recent advances in multiobjective optimization (Q2150752) (← links)
- Approximation algorithms for clustering with dynamic points (Q2168849) (← links)
- Multiobjective programming with new invexities (Q2377210) (← links)
- Bulk-robust combinatorial optimization (Q2515045) (← links)
- Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives (Q2976146) (← links)
- Approximation-Friendly Discrepancy Rounding (Q3186517) (← links)
- (Q4387240) (← links)
- (Q4525708) (← links)
- On Double-Resolution Imaging and Discrete Tomography (Q4568092) (← links)
- Optimal Network Design with End-to-End Service Requirements (Q4604906) (← links)
- Generalized Center Problems with Outliers (Q4972687) (← links)
- Ranking with Fairness Constraints (Q5002698) (← links)
- Generalized center problems with outliers (Q5002700) (← links)
- Approximation Methods for Multiobjective Optimization Problems: A Survey (Q5084597) (← links)
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming (Q5085998) (← links)
- Evolutionary Multi-Criterion Optimization (Q5709909) (← links)
- The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich (Q5863324) (← links)
- (Q5874506) (← links)
- Approximate multi-matroid intersection via iterative refinement (Q5918919) (← links)
- On the minimum \(s-t\) cut problem with budget constraints (Q6120941) (← links)
- Approximating the shortest path problem with scenarios (Q6652474) (← links)