The following pages link to Paweł Zieliński (Q221181):
Displaying 50 items.
- Single machine scheduling problems with uncertain parameters and the OWA criterion (Q282249) (← links)
- Possibilistic bottleneck combinatorial optimization problems with ill-known weights (Q433509) (← links)
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320) (← links)
- Combinatorial optimization problems with uncertain costs and the OWA criterion (Q482291) (← links)
- The computational complexity of the relative robust shortest path problem with interval data (Q596264) (← links)
- On the approximability of robust spanning tree problems (Q620950) (← links)
- Criticality analysis of activity networks under interval uncertainty (Q633555) (← links)
- On iterative algorithms for the polar decomposition of a matrix and the matrix sign function (Q670807) (← links)
- A robust lot sizing problem with ill-known demands (Q690887) (← links)
- On combinatorial optimization problems on matroids with uncertain weights (Q856278) (← links)
- Using the WOWA operator in robust discrete optimization problems (Q895514) (← links)
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion (Q943795) (← links)
- On the approximability of minmax (regret) network optimization problems (Q976089) (← links)
- Some methods for evaluating the optimality of elements in matroids with ill-known weights (Q1037947) (← links)
- Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights (Q1044085) (← links)
- An approximation algorithm for interval data minmax regret combinatorial optimization problems (Q1045926) (← links)
- On recoverable and two-stage robust selection problems with budgeted uncertainty (Q1681259) (← links)
- On computing the latest starting times and floats of activities in a network with imprecise durations (Q1770714) (← links)
- Approximability of the robust representatives selection problem (Q1785311) (← links)
- Stefan Chanas (1946 -- 2002). Obituary (Q1867706) (← links)
- On the hardness of evaluating criticality of activities in a planar network with duration intervals (Q1870004) (← links)
- Approximating the min-max (regret) selecting items problem (Q1941689) (← links)
- Ranking fuzzy interval numbers in the setting of random sets -- further results (Q1961816) (← links)
- On the equivalence of two optimization methods for fuzzy linear programming problems (Q1969890) (← links)
- Complexity of the robust weighted independent set problems on interval graphs (Q2018858) (← links)
- Solving robust two-stage combinatorial optimization problems under convex uncertainty (Q2050273) (← links)
- Production planning under demand uncertainty: a budgeted uncertainty approach (Q2050274) (← links)
- Robust inventory problem with budgeted cumulative demand uncertainty (Q2091209) (← links)
- Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty (Q2125227) (← links)
- Approximating combinatorial optimization problems with the ordered weighted averaging criterion (Q2189877) (← links)
- Combinatorial two-stage minmax regret problems under interval uncertainty (Q2241200) (← links)
- A randomized algorithm for the min-Max selecting items problem with uncertain weights (Q2267304) (← links)
- Two-stage combinatorial optimization problems under risk (Q2283029) (← links)
- Risk-averse single machine scheduling: complexity and approximation (Q2286434) (← links)
- The recoverable robust spanning tree problem with interval costs is polynomially solvable (Q2361123) (← links)
- Recoverable robust spanning tree problem under interval uncertainty representations (Q2410105) (← links)
- Robust recoverable and two-stage selection problems (Q2410249) (← links)
- Robust recoverable 0-1 optimization problems under polyhedral uncertainty (Q2424772) (← links)
- Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion (Q2450748) (← links)
- On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data (Q2457271) (← links)
- The robust shortest path problem in series -- parallel multidigraphs with interval data (Q2583712) (← links)
- Robust Discrete Optimization Problems with the WOWA Criterion (Q2806941) (← links)
- Robust Single Machine Scheduling Problem with Weighted Number of Late Jobs Criterion (Q2806942) (← links)
- Bottleneck Combinatorial Optimization Problems with Fuzzy Scenarios (Q2838658) (← links)
- Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems (Q3055576) (← links)
- Interval PERT and Its Fuzzy Extension (Q3057688) (← links)
- Parallel Machine Scheduling under Uncertainty (Q3143637) (← links)
- Decision Making under Scenario Uncertainty in a Requirement Planning (Q3143638) (← links)
- Interval Analysis in Scheduling (Q3524176) (← links)
- Random Subsets of the Interval and P2P Protocols (Q3603482) (← links)
