Found: 21
Select item for more details and to access through your institution.
Controlled sub‐10‐nanometer poly(<italic>N</italic>‐isopropyl‐acrylamide) layers grafted from silicon by atom transfer radical polymerization.
- Published in:
- Polymers for Advanced Technologies, 2018, v. 29, n. 2, p. 806, doi. 10.1002/pat.4187
- By:
- Publication type:
- Article
Approximation Algorithms and Linear Programming Relaxations for Scheduling Problems Related to Min-Sum Set Cover.
- Published in:
- Mathematics of Operations Research, 2024, v. 49, n. 1, p. 578, doi. 10.1287/moor.2023.1368
- By:
- Publication type:
- Article
Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses.
- Published in:
- Mathematics of Operations Research, 2022, v. 47, n. 1, p. 643, doi. 10.1287/moor.2021.1144
- By:
- Publication type:
- Article
The Gomory-Chvátal Closure of a Nonrational Polytope Is a Rational Polytope.
- Published in:
- Mathematics of Operations Research, 2013, v. 38, n. 1, p. 63, doi. 10.1287/moor.1120.0565
- By:
- Publication type:
- Article
Near-Optimal Solutions and Large Integrality Gaps for Almost All Instances of Single-Machine Precedence-Constrained Scheduling.
- Published in:
- Mathematics of Operations Research, 2011, v. 36, n. 1, p. 14, doi. 10.1287/moor.1100.0479
- By:
- Publication type:
- Article
On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games.
- Published in:
- Mathematics of Operations Research, 2008, v. 33, n. 4, p. 851, doi. 10.1287/moor.1080.0322
- By:
- Publication type:
- Article
Single-Machine Scheduling with Precedence Constraints.
- Published in:
- Mathematics of Operations Research, 2005, v. 30, n. 4, p. 1005, doi. 10.1287/moor.1050.0158
- By:
- Publication type:
- Article
Selfish Routing in Capacitated Networks.
- Published in:
- Mathematics of Operations Research, 2004, v. 29, n. 4, p. 961, doi. 10.1287/moor.1040.0098
- By:
- Publication type:
- Article
THE COMPLEXITY OF GENERIC PRIMAL ALGORITHMS FOR SOLVING GENERAL INTEGER PROGRAMS.
- Published in:
- Mathematics of Operations Research, 2002, v. 27, n. 4, p. 681, doi. 10.1287/moor.27.4.681.305
- By:
- Publication type:
- Article
SCHEDULING TO MINIMIZE AVERAGE COMPLETION TIME: OFF-LINE AND ON-LINE APPROXIMATION ALGORITHMS.
- Published in:
- Mathematics of Operations Research, 1997, v. 22, n. 3, p. 513, doi. 10.1287/moor.22.3.513
- By:
- Publication type:
- Article
Solving Project Scheduling Problems by Minimum Cut Computations.
- Published in:
- Management Science, 2003, v. 49, n. 3, p. 330, doi. 10.1287/mnsc.49.3.330.12737
- By:
- Publication type:
- Article
Robust monotone submodular function maximization.
- Published in:
- Mathematical Programming, 2018, v. 172, n. 1/2, p. 505, doi. 10.1007/s10107-018-1320-2
- By:
- Publication type:
- Article
An FPTAS for optimizing a class of low-rank functions over a polytope.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 103, doi. 10.1007/s10107-011-0511-x
- By:
- Publication type:
- Article
Efficiency and fairness of system-optimal routing with user constraints.
- Published in:
- Networks, 2006, v. 48, n. 4, p. 223, doi. 10.1002/net.20133
- By:
- Publication type:
- Article
The Competitive Pickup and Delivery Orienteering Problem for Balancing Car-Sharing Systems.
- Published in:
- Transportation Science, 2021, v. 55, n. 6, p. 1232, doi. 10.1287/trsc.2021.1041
- By:
- Publication type:
- Article
Integer Factorization: Why Two-Item Joint Replenishment Is Hard.
- Published in:
- Operations Research, 2024, v. 72, n. 3, p. 1192, doi. 10.1287/opre.2022.2390
- By:
- Publication type:
- Article
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One.
- Published in:
- Operations Research, 2013, v. 61, n. 2, p. 386, doi. 10.1287/opre.1120.1093
- By:
- Publication type:
- Article
Sharing Supermodular Costs.
- Published in:
- Operations Research, 2010, v. 58, n. 4, p. 1051, doi. 10.1287/opre.1100.0841
- By:
- Publication type:
- Article
Fast, Fair, and Efficient Flows in Networks.
- Published in:
- Operations Research, 2007, v. 55, n. 2, p. 215, doi. 10.1287/opre.1070.0383
- By:
- Publication type:
- Article
System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion.
- Published in:
- Operations Research, 2005, v. 53, n. 4, p. 600, doi. 10.1287/opre.1040.0197
- By:
- Publication type:
- Article
The complexity of welfare maximization in congestion games.
- Published in:
- Networks, 2012, v. 59, n. 2, p. 252, doi. 10.1002/net.20439
- By:
- Publication type:
- Article