The following pages link to Alexander Grigoriev (Q423944):
Displaying 50 items.
- A note on planar graphs with large width parameters and small grid-minors (Q423947) (← links)
- A note on the integrality gap of an ILP formulation for the periodic maintenance problem (Q433120) (← links)
- Dynamic pricing problems with elastic demand (Q439910) (← links)
- On the complexity of a bundle pricing problem (Q657580) (← links)
- Project scheduling with irregular costs: complexity, approximability, and algorithms (Q707495) (← links)
- Price strategy implementation (Q709178) (← links)
- On the minimum corridor connection problem and other generalized geometric problems (Q833722) (← links)
- Machine scheduling with resource dependent processing times (Q877194) (← links)
- The geometric generalized minimum spanning tree problem with grid clustering (Q882648) (← links)
- Treewidth lower bounds with brambles (Q926284) (← links)
- (Q957365) (redirect page) (← links)
- Optimal bundle pricing with monotonicity constraint (Q957368) (← links)
- Scheduling jobs with time-resource tradeoff via nonlinear programming (Q1040086) (← links)
- Scheduling unit-length jobs with precedence constraints of small height (Q1667212) (← links)
- Location, pricing and the problem of Apollonius (Q1686568) (← links)
- An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions (Q1694399) (← links)
- Inland waterway efficiency through skipper collaboration and joint speed optimization (Q2030569) (← links)
- Dispersing obnoxious facilities on a graph (Q2032349) (← links)
- Cyclic lot-sizing problems with sequencing costs (Q2061136) (← links)
- Knot diagrams of treewidth two (Q2110609) (← links)
- On the status sequences of trees (Q2219062) (← links)
- Vessel velocity decisions in inland waterway transportation under uncertainty (Q2242314) (← links)
- On time-optimal trajectories in non-uniform mediums (Q2347576) (← links)
- Algorithms for graphs embeddable with few crossings per edge (Q2461632) (← links)
- Modeling and solving the periodic maintenance problem (Q2488905) (← links)
- On the high multiplicity traveling salesman problem (Q2494812) (← links)
- Quantum theory of neutrino spin-light in matter (Q2568891) (← links)
- A framework for the complexity of high-multiplicity scheduling problems (Q2569171) (← links)
- High Multiplicity Scheduling with Switching Costs for Few Products (Q2806978) (← links)
- On planar graphs with large tree-width and small grid minors (Q2839208) (← links)
- The Valve Location Problem in Simple Network Topologies (Q2899077) (← links)
- Bidimensionality of Geometric Intersection Graphs (Q2938107) (← links)
- On Low Treewidth Graphs and Supertrees (Q2941748) (← links)
- A Note on the Minimum H-Subgraph Edge Deletion (Q2947962) (← links)
- A PTAS for the Cluster Editing Problem on Planar Graphs (Q2971154) (← links)
- How to Cut a Graph into Many Pieces (Q3010400) (← links)
- Location, Pricing and the Problem of Apollonius (Q3133244) (← links)
- Basic scheduling problems with raw material constraints (Q3367034) (← links)
- Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph (Q3401110) (← links)
- On the Complexity of the Highway Pricing Problem (Q3401111) (← links)
- How to Sell a Graph: Guidelines for Graph Retailers (Q3522949) (← links)
- Bundle Pricing with Comparable Items (Q3527236) (← links)
- LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times (Q3595396) (← links)
- Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times (Q3596345) (← links)
- (Q4427859) (← links)
- Complexity and approximability of the <i>k</i>‐way vertex cut (Q4639693) (← links)
- SPIN LIGHT OF NEUTRINO IN GRAVITATIONAL FIELDS (Q4680599) (← links)
- Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs (Q5042451) (← links)
- Dispersing Obnoxious Facilities on a Graph (Q5090483) (← links)
- (Q5091522) (← links)
