The following pages link to Tamás Kis (Q256640):
Displaying 50 items.
- Approximability of scheduling problems with resource consuming jobs (Q256641) (← links)
- Solving resource constrained shortest path problems with LP-based methods (Q342436) (← links)
- On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts (Q344930) (← links)
- Approximation schemes for single machine scheduling with non-renewable resource constraints (Q398908) (← links)
- Resource leveling in a machine environment (Q418090) (← links)
- On bilevel machine scheduling problems (Q421065) (← links)
- Reductions between scheduling problems with non-renewable resources and knapsack problems (Q482287) (← links)
- Constraint programming approach to a bilevel scheduling problem (Q647473) (← links)
- On the complexity of the car sequencing problem. (Q703239) (← links)
- Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications (Q835582) (← links)
- Polyhedral results on single node variable upper-bound flow models with allowed configurations (Q865750) (← links)
- A projective algorithm for preemptive open shop scheduling with two multiprocessor groups (Q969520) (← links)
- Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (Q1011298) (← links)
- Partitioning of trees for minimizing height and cardinality (Q1029076) (← links)
- Scheduling multiprocessor UET tasks of two sizes (Q1034607) (← links)
- Job-shop scheduling with processing alternatives. (Q1410614) (← links)
- (Q1662164) (redirect page) (← links)
- Erratum to ``Intersection cuts -- standard versus restricted'' (Q1662165) (← links)
- Approximation schemes for parallel machine scheduling with non-renewable resources (Q1698888) (← links)
- Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price (Q1725820) (← links)
- Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem (Q1732114) (← links)
- Multi-criteria approximation schemes for the resource constrained shortest path problem (Q1749776) (← links)
- Intersection cuts -- standard versus restricted (Q1751139) (← links)
- A probabilistic approach to pickup and delivery problems with time window uncertainty (Q1755385) (← links)
- A cutting plane approach for integrated planning and scheduling (Q1761978) (← links)
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem (Q1767678) (← links)
- Approximability of total weighted completion time with resource consuming jobs (Q1785443) (← links)
- A lower bound for the job insertion problem. (Q1811122) (← links)
- On the complexity of non-preemptive shop scheduling with two jobs (Q1849563) (← links)
- Lifting Gomory cuts with bounded variables (Q1949677) (← links)
- Strong cuts from compatibility relations for the dial-a-ride problem (Q2065792) (← links)
- New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints (Q2078845) (← links)
- Ideal, non-extended formulations for disjunctive constraints admitting a network representation (Q2149570) (← links)
- A common approximation framework for early work, late work, and resource leveling problems (Q2184097) (← links)
- Exact solution approaches for bilevel lot-sizing (Q2253561) (← links)
- Polyhedral results for position-based scheduling of chains on a single machine (Q2288972) (← links)
- Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints (Q2294889) (← links)
- Lift-and-project for general two-term disjunctions (Q2339813) (← links)
- Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times (Q2434321) (← links)
- A branch-and-cut algorithm for scheduling of projects with variable-intensity activities (Q2487846) (← links)
- Approximations and auctions for scheduling batches on related machines (Q2643820) (← links)
- Assembly planning by disjunctive programming and geometrical reasoning (Q2669707) (← links)
- A project scheduling problem with periodically aggregated resource-constraints (Q2669745) (← links)
- (Q3426431) (← links)
- Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method (Q3612413) (← links)
- Polyhedral Results and Branch-and-Cut for the Resource Loading Problem (Q4995060) (← links)
- Joint replenishment meets scheduling (Q6102849) (← links)
- Robust facility location in reverse logistics (Q6115584) (← links)
- An online joint replenishment problem combined with single machine scheduling (Q6166202) (← links)
- A cost function approximation method for dynamic vehicle routing with docking and LIFO constraints (Q6533121) (← links)
