Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
99 | Panagiotis Kouvelis, Serpil Sayin |
Algorithm robust for the bicriteria discrete optimization problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 147(1), pp. 71-85, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Efficient set, Bicriteria discrete optimization, Robust optimization, Multiple objective optimization |
77 | Madhav V. Marathe, R. Ravi 0001, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III |
Bicriteria Network Design Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 22nd International Colloquium, ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings, pp. 487-498, 1995, Springer, 3-540-60084-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
70 | Yuval Rabani, Gabriel Scalosub |
Bicriteria approximation tradeoff for the node-cost budget problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 5(2), pp. 19:1-19:14, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Approximation algorithms, bicriteria approximation |
62 | Anita Schöbel, Albrecht Kratz |
A Bicriteria Approach for Robust Timetabling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Robust and Online Large-Scale Optimization ![In: Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, pp. 119-144, 2009, Springer, 978-3-642-05464-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
62 | Anita Schöbel |
Locating Stops Along Bus or Railway Lines - A Bicriteria Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 136(1), pp. 211-227, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
bicriterial, dynamic programming, location, set covering, public transportation |
58 | Sándor P. Fekete, Joseph S. B. Mitchell, Christiane Schmidt 0001 |
Minimum Covering with Travel Cost. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 393-402, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
56 | Fabien Baille, Evripidis Bampis, Christian Laforest, Christophe Rapine |
Bicriteria scheduling for contiguous and non contiguous parallel tasks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 159(1), pp. 97-106, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Scheduling, Parallel tasks, Bicriteria approximation |
56 | Liron Yedidsion, Dvir Shabtay, Moshe Kaspi |
A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 10(6), pp. 341-352, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Bicriteria, Convex resource allocation, Maximal lateness, Single machine scheduling |
56 | Davide Bilò, Luciano Gualà, Guido Proietti |
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAN ![In: Combinatorial and Algorithmic Aspects of Networking, Third Workshop, CAAN 2006, Chester, UK, July 2, 2006. Revised Papers, pp. 19-30, 2006, Springer, 3-540-48822-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Multi-parameter Agents, Bicriteria Network Design, Truthful Single-Minded Mechanisms, Algorithmic Mechanism Design |
48 | Louis-Claude Canon, Emmanuel Jeannot |
Scheduling strategies for the bicriteria optimization of the robustness and makespan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 22nd IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008, Miami, Florida USA, April 14-18, 2008, pp. 1-8, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
48 | Yuval Rabani, Gabriel Scalosub |
Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings, pp. 90-101, 2008, Springer, 978-3-540-69900-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
48 | René Beier, Heiko Röglin, Berthold Vöcking |
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings, pp. 53-67, 2007, Springer, 978-3-540-72791-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
48 | Vittorio Bilò, Michele Flammini, Roberto Giovannelli |
Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental and Efficient Algorithms, Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings, pp. 33-46, 2003, Springer, 3-540-40205-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
41 | Baoqiang Fan, Rongjun Chen, Guochun Tang |
Bicriteria Scheduling on Single-Machine with Inventory Operations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings, pp. 395-402, 2009, Springer, 978-3-642-02025-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
bicriteria, scheduling, approximation algorithm, NP-hardness, performance ratio |
41 | Hakan Gultekin, M. Selim Akturk, Oya Ekin Karasan |
Bicriteria robotic cell scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 11(6), pp. 457-473, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Bicriteria optimization, CNC, Robotic cell, Controllable processing times |
41 | Subhash C. Sarin, Divya Prakash |
Equal Processing Time Bicriteria Scheduling on Parallel Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 8(3), pp. 227-240, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
bicriteria scheduling, equal processing time jobs, parallel machines |
37 | Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie, Andrea Vitaletti |
Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: Structural Information and Communication Complexity, 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings, pp. 139-150, 2007, Springer, 978-3-540-72918-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
bicriteria optimization, sensor networks, distributed algorithms, data aggregation |
37 | Marta M. B. Pascoal, M. Eugénia V. Captivo, João C. N. Clímaco |
A comprehensive survey on the quickest path problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 147(1), pp. 5-21, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Bicriteria problem, Minsum-maxmin, Quickest path, Paths ranking |
37 | Natalia V. Shakhlevich, Vitaly A. Strusevich |
Pre-Emptive Scheduling Problems with Controllable Processing Times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 8(3), pp. 233-253, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
bicriteria problems, greedy algorithms, single machine scheduling, parallel machine scheduling, polymatroids, controllable processing times |
37 | Asaf Levin, Gerhard J. Woeginger |
The Constrained Minimum Weighted Sum of Job Completion Times Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings, pp. 298-307, 2004, Springer, 3-540-22113-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
bicriteria optimization, scheduling, approximation scheme |
37 | Konstantin Andreev, Harald Räcke |
Balanced graph partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 27-30, 2004, Barcelona, Spain, pp. 120-124, 2004, ACM, 1-58113-840-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
approximation algorithms, graph partitioning, bicriteria approximation |
37 | Jochen Könemann, R. Ravi 0001 |
Primal-dual meets local search: approximating MST's with nonuniform degree bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 389-395, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
degree-bounded spanning trees, approximation algorithms, spanning trees, network algorithms, bicriteria approximation |
37 | Francis Sourd |
Preemptive Scheduling with Two Minimax Criteria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 107(1-4), pp. 303-319, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
bicriteria, length of a schedule, preemptive scheduling, single-machine |
37 | Joseph Naor, Baruch Schieber |
Improved Approximations for Shallow-Light Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 536-541, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
shallow-light spanning trees, bicriteria optimization, non-trivial approximation factors, information retrieval, directed graphs, directed graph, directed graphs, polynomial time algorithm, VLSI design |
33 | Savio S. H. Tse |
Online Bicriteria Load Balancing Using Object Reallocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 20(3), pp. 379-388, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
33 | Lin Lin 0008, Mitsuo Gen |
A bicriteria shortest path routing problems by hybrid genetic algorithm in communication networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Congress on Evolutionary Computation ![In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2007, 25-28 September 2007, Singapore, pp. 4577-4582, 2007, IEEE, 978-1-4244-1339-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
33 | S. Afshin Mansouri, S. Hamed Hendizadeh, Nasser Salmasi |
Bicriteria two-machine flowshop scheduling using metaheuristics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2007, Proceedings, London, England, UK, July 7-11, 2007, pp. 909, 2007, ACM, 978-1-59593-697-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Pareto-optimal frontier, sequence-dependent setups, genetic algorithms, simulated annealing, flowshop, multicriteria scheduling |
33 | Alexei B. Piunovskiy |
Bicriteria Optimization of a Queue with a Controlled Input Stream. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Queueing Syst. Theory Appl. ![In: Queueing Syst. Theory Appl. 48(1-2), pp. 159-184, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
controlled jump Markov processes, Lagrange function, threshold control, communication networks, Pareto set, constrained optimization problems |
33 | Vittorio Bilò, Michele Flammini, Luca Moscardelli |
Pareto Approximations for the Bicriteria Scheduling Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), CD-ROM / Abstracts Proceedings, 26-30 April 2004, Santa Fe, New Mexico, USA, 2004, IEEE Computer Society, 0-7695-2132-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
33 | Eric Angel, Evripidis Bampis, Laurent Gourvès |
Approximating the Pareto Curve with Local Search for the Bicriteria TSP (1, 2) Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings, pp. 39-48, 2003, Springer, 3-540-40543-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
33 | Gaofeng Huang, Andrew Lim 0001 |
Fragmental Optimization on the 2-Machine Bicriteria Flowshop Scheduling Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2003), 3-5 November 2003, Sacramento, California, USA, pp. 194-, 2003, IEEE Computer Society, 0-7695-2038-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi |
Assignment problem in content distribution networks: unsplittable hard-capacitated facility location. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 805-814, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Daniel Berend, Michael Segal 0001, Hanan Shpungin |
Power efficient resilience and lifetime in wireless ad-hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOWANC ![In: Proceedings of the 1st ACM International Workshop on Foundations of Wireless Ad Hoc and Sensor Networking and Computing, FOWANC 2008, Hong Kong, SAR, China, May 26, 2008, pp. 17-24, 2008, ACM, 978-1-60558-149-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
strong connectivity, fault tolerance, wireless ad-hoc networks, topology control, energy consumption, network lifetime |
29 | Zoya Svitkina |
Lower-bounded facility location. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 1154-1163, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
29 | Sanjiv Kapoor, Mohammad Sarwat |
Bounded-Diameter Minimum-Cost Graph Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 41(4), pp. 779-794, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Julia Chuzhoy, Sanjeev Khanna |
Hardness of cut problems in directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 527-536, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
directed multicut, hardness of approximation, sparsest cut |
29 | Jian-Hung Chen, Shinn-Ying Ho, David E. Goldberg |
Quality-time analysis of multi-objective evolutionary algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2005, Proceedings, Washington DC, USA, June 25-29, 2005, pp. 1455-1462, 2005, ACM, 1-59593-010-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
dissimilar schemata, convergence, multi-objective evolutionary algorithms, population sizing |
29 | Artur Czumaj, Piotr Krysta, Berthold Vöcking |
Selfish traffic allocation for server farms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 287-296, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
TCP/IP |
29 | Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe |
Budget Constrained Minimum Cost Connected Medians. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings, pp. 267-278, 2000, Springer, 3-540-41183-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
29 | Fumihiko Shimada, Hiroaki Ishii, Takeshi Itoh |
Spanning tree problem on a fuzzy network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES (1) ![In: Knowledge-Based Intelligent Electronic Systems, 2nd International Conference, KES 1998, Adelaide, South Australia, 21-23 April 1998, Proceedings, Part I, pp. 267-271, 1998, IEEE. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
29 | Madhav V. Marathe, R. Ravi 0001, Ravi Sundaram |
Service-Constrained Network Design Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '96, 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3-5, 1996, Proceedings, pp. 28-40, 1996, Springer, 3-540-61422-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
22 | Jochen Könemann, Asaf Levin, Amitabh Sinha |
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 41(2), pp. 117-129, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Degree-bounded spanning trees, Approximation algorithms, Spanning trees, Bicriteria approximation |
22 | Martin Skutella |
Approximating the single source unsplittable min-cost flow problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 136-145, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
single source unsplittable min-cost flow problem, common source vertex, destination vertices, edge capacities, virtual-circuit routing, hard cost constraints, computational complexity, load balancing, resource allocation, combinatorial optimization, partitioning, optimisation, processor scheduling, NP-complete problems, packing, hardness, bicriteria approximations |
22 | Joseph S. B. Mitchell, Christine D. Piatko, Esther M. Arkin |
Computing a Shortest k-Link Path in a Polygon ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 573-582, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
exact polynomial-time algorithm, shortest k-link path, bicriteria path problem, computational geometry, polygon, running time, visibility graph, holes |
19 | Xiaojuan Jiang, Kangbok Lee, Michael L. Pinedo |
Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 27(1), pp. 61-86, February 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
19 | Shuguang Li, Zhichao Geng |
Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 180, pp. 106343, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | José M. F. Craveirinha, Marta Pascoal, João C. N. Clímaco |
An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOR Inf. Syst. Oper. Res. ![In: INFOR Inf. Syst. Oper. Res. 61(3), pp. 399-418, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula |
The complexity of bicriteria tree-depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 947, pp. 113682, February 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Khaled Elbassioni |
A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 51(5), pp. 507-514, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm |
Bicriteria Multidimensional Mechanism Design with Side Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.14234, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Wenjing Chen, Victoria G. Crawford |
Bicriteria Approximation Algorithms for the Submodular Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2309.14558, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Jatinder N. D. Gupta, Chin-Chia Wu, Win-Chin Lin, Xingong Zhang, Danyu Bai, Bertrand M. T. Lin, Chia-Cheng Liao |
Bicriteria single-machine scheduling with multiple job classes and customer orders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Soft Comput. ![In: Appl. Soft Comput. 147, pp. 110809, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Xiaojuan Jiang, Kangbok Lee, Michael L. Pinedo |
Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 305(2), pp. 594-607, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | René Beier, Heiko Röglin, Clemens Rösner, Berthold Vöcking |
The smoothed number of Pareto-optimal solutions in bicriteria integer optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 200(1), pp. 319-355, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Yijie Li |
Bicriteria fabrication scheduling of two-component jobs on a single machine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. ![In: Oper. Res. 23(4), pp. 58, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Rafael García-Jiménez, J. Carlos García-Díaz, Alexander D. Pulido-Rojano |
Bicriteria food packaging process optimization in double-layered upright and diagonal multihead weighers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Appl. Math. ![In: J. Comput. Appl. Math. 428, pp. 115168, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Hangjun Che, Jun Wang 0002, Andrzej Cichocki |
Bicriteria Sparse Nonnegative Matrix Factorization via Two-Timescale Duplex Neurodynamic Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Neural Networks Learn. Syst. ![In: IEEE Trans. Neural Networks Learn. Syst. 34(8), pp. 4881-4891, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Mei Liu, Li He, Mingsheng Shang 0001 |
Dynamic Neural Network for Bicriteria Weighted Control of Robot Manipulators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Neural Networks Learn. Syst. ![In: IEEE Trans. Neural Networks Learn. Syst. 34(8), pp. 4570-4583, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Canh V. Pham, Quat V. Phu, Dung T. K. Ha |
Fast Bicriteria Approximation Algorithm for Minimum Cost Submodular Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSoNet ![In: Computational Data and Social Networks - 12th International Conference, CSoNet 2023, Hanoi, Vietnam, December 11-13, 2023, Proceedings, pp. 186-197, 2023, Springer, 978-981-97-0668-6. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Wenjing Chen, Victoria G. Crawford |
Bicriteria Approximation Algorithms for the Submodular Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeurIPS ![In: Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023., 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
19 | Siddharth Prasad, Maria-Florina Balcan, Tuomas Sandholm |
Bicriteria Multidimensional Mechanism Design with Side Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeurIPS ![In: Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023., 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
19 | Tanvi Bajpai, Chandra Chekuri |
Bicriteria Approximation Algorithms for Priority Matroid Median. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, pp. 7:1-7:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-296-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Victoria G. Crawford |
Scalable Bicriteria Algorithms for Non-Monotone Submodular Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AISTATS ![In: International Conference on Artificial Intelligence and Statistics, 25-27 April 2023, Palau de Congressos, Valencia, Spain., pp. 9517-9537, 2023, PMLR. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
19 | Hari Nandan Nath, Stephan Dempe, Tanka Nath Dhamala |
A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asia Pac. J. Oper. Res. ![In: Asia Pac. J. Oper. Res. 39(3), pp. 2150027:1-2150027:24, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Xiaoli Zhao, Jian Xu, Ji-Bo Wang, Lin Li |
Bicriteria Common Flow Allowance Scheduling with Aging Effect, Convex Resource Allocation, and a Rate-Modifying Activity on a Single Machine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asia Pac. J. Oper. Res. ![In: Asia Pac. J. Oper. Res. 39(5), pp. 2150046:1-2150046:21, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Yang-Kuei Lin, Tzu-Yueh Yin |
Generating bicriteria schedules for correlated parallel machines involving tardy jobs and weighted completion time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 319(2), pp. 1655-1688, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Zhijun Zhang 0003, Siyuan Chen 0006, Mingzhen He |
Taylor Discrete Circadian Rhythms Neural Network for Resolving Bicriteria Optimization Problem of Redundant Robot Manipulators Perturbed by Periodic Noises. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Ind. Informatics ![In: IEEE Trans. Ind. Informatics 18(9), pp. 6015-6025, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay |
SETH-based Lower Bounds for Subset Sum and Bicriteria Path. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 18(1), pp. 6:1-6:22, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Xiaohui Ren, Pengchao Zhang, Zhijun Zhang 0003 |
Bicriteria Velocity Minimization Approach of Self-Motion for Redundant Robot Manipulators With Varying-Gain Recurrent Neural Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Cogn. Dev. Syst. ![In: IEEE Trans. Cogn. Dev. Syst. 14(2), pp. 578-587, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Tanvi Bajpai, Chandra Chekuri |
Bicriteria Approximation Algorithms for Priority Matroid Median. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.01888, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Meenakshi Sharma, Manisha Sharma, Sameer Sharma |
Desert sparrow optimization algorithm for the bicriteria flow shop scheduling problem with sequence-independent setup time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. ![In: Oper. Res. 22(4), pp. 4353-4396, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Yijing Wang, Dachuan Xu, Donglei Du, Yanjun Jiang |
Bicriteria streaming algorithms to balance gain and cost with cardinality constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 44(4), pp. 2946-2962, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Tim Oosterwijk, Daniel Schmand, Marc Schröder 0002 |
Bicriteria Nash Flows over Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Web and Internet Economics - 18th International Conference, WINE 2022, Troy, NY, USA, December 12-15, 2022, Proceedings, pp. 368, 2022, Springer, 978-3-031-22831-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
19 | Joanna Jedrzejowicz, Piotr Jedrzejowicz |
Bicriteria Oversampling for Imbalanced Data Classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES ![In: Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 26th International Conference KES-2022, Verona, Italy and Virtual Event, 7-9 September 2022., pp. 245-254, 2022, Elsevier. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Mengxue Geng, Shufang Gong, Bin Liu 0009, Weili Wu 0001 |
Bicriteria Algorithms for Maximizing the Difference Between Submodular Function and Linear Function Under Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management - 16th International Conference, AAIM 2022, Guangzhou, China, August 13-14, 2022, Proceedings, pp. 133-143, 2022, Springer, 978-3-031-16080-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Hakan Gultekin, Sinan Gürel, Rabia Taspinar |
Bicriteria scheduling of a material handling robot in an m-machine cell to minimize the energy consumption of the robot and the cycle time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Robotics Comput. Integr. Manuf. ![In: Robotics Comput. Integr. Manuf. 72, pp. 102207, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
19 | Yijing Wang, Dachuan Xu, Donglei Du, Ran Ma |
Bicriteria algorithms to balance coverage and cost in team formation under online model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 854, pp. 68-76, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
19 | Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula |
The Complexity of Bicriteria Tree-Depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2101.06645, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
19 | Tim Oosterwijk, Daniel Schmand, Marc Schröder 0002 |
Bicriteria Nash Flows over Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2111.08589, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
19 | Victoria G. Crawford |
Streaming Based Bicriteria Approximation Algorithms for Submodular Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2112.09985, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
19 | Jonathan A. Noel, Mashbat Suzuki, Adrian Vetta |
Pirates in Wonderland: Liquid Democracy has Bicriteria Guarantees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2105.05142, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
19 | Wu Lin, Qiuzhen Lin, Junkai Ji, Zexuan Zhu, Carlos A. Coello Coello, Ka-Chun Wong |
Decomposition-based multiobjective optimization with bicriteria assisted adaptive operator selection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Swarm Evol. Comput. ![In: Swarm Evol. Comput. 60, pp. 100790, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
19 | Rubing Chen, Jinjiang Yuan, C. T. Ng 0001, T. C. E. Cheng |
Bicriteria scheduling to minimize total late work and maximum tardiness with preemption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Ind. Eng. ![In: Comput. Ind. Eng. 159, pp. 107525, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
19 | Jonathan A. Noel, Mashbat Suzuki, Adrian Vetta |
Pirates in Wonderland: Liquid Democracy has Bicriteria Guarantees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGT ![In: Algorithmic Game Theory - 14th International Symposium, SAGT 2021, Aarhus, Denmark, September 21-24, 2021, Proceedings, pp. 391-405, 2021, Springer, 978-3-030-85946-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
19 | Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula |
The Complexity of Bicriteria Tree-Depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings, pp. 100-113, 2021, Springer, 978-3-030-86592-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
19 | Peter Rottmann, Anne Driemel, Herman J. Haverkort, Heiko Röglin, Jan-Henrik Haunert |
Bicriteria Aggregation of Polygons via Graph Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GIScience (II) ![In: 11th International Conference on Geographic Information Science, GIScience 2021, September 27-30, 2021, Poznań, Poland (Virtual Conference) - Part II., pp. 6:1-6:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-208-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
19 | Weijun Xie 0001, Shabbir Ahmed 0001 |
Bicriteria Approximation of Chance-Constrained Covering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. ![In: Oper. Res. 68(2), pp. 516-533, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
19 | Thiago Alves de Queiroz, Leandro Resende Mundim |
Multiobjective pseudo-variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. Trans. Oper. Res. ![In: Int. Trans. Oper. Res. 27(3), pp. 1478-1500, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
19 | Marta M. B. Pascoal, João C. N. Clímaco |
On a relaxed maximally disjoint path pair problem: a bicriteria approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. Trans. Oper. Res. ![In: Int. Trans. Oper. Res. 27(4), pp. 2045-2063, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
19 | Yishuo Shi, Yingli Ran, Zhao Zhang 0002, Ding-Zhu Du |
A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 803, pp. 1-9, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
19 | Qiulan Zhao, Jinjiang Yuan |
Bicriteria scheduling of equal length jobs on uniform parallel machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 39(3), pp. 637-661, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
19 | Yijing Wang, Dachuan Xu, Donglei Du, Ran Ma |
Online Bicriteria Algorithms to Balance Coverage and Cost in Team Formation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management - 14th International Conference, AAIM 2020, Jinhua, China, August 10-12, 2020, Proceedings, pp. 25-36, 2020, Springer, 978-3-030-57601-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
19 | Shih-Cheng Horng, Shieh-Shing Lin |
Bat algorithm assisted by ordinal optimization for solving discrete probabilistic bicriteria optimization problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Simul. ![In: Math. Comput. Simul. 166, pp. 346-364, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
19 | Pawel B. Myszkowski, Maciej Laszczyk, Ivan Nikulin, Marek Skowronski |
iMOPSE: a library for bicriteria optimization in Multi-Skill Resource-Constrained Project Scheduling Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 23(10), pp. 3397-3410, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
19 | Syrine Roufaida Ait Haddadene, Nacima Labadie, Caroline Prodhon |
Bicriteria Vehicle Routing Problem with Preferences and Timing Constraints in Home Health Care Services. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms ![In: Algorithms 12(8), pp. 152, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
19 | Haitao Wang 0001 |
Bicriteria Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 62(3), pp. 525-582, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
19 | Andrea Farruggia, Paolo Ferragina, Antonio Frangioni, Rossano Venturini |
Bicriteria Data Compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 48(5), pp. 1603-1642, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
19 | Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay |
SETH-Based Lower Bounds for Subset Sum and Bicriteria Path. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pp. 41-57, 2019, SIAM, 978-1-61197-548-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
19 | Petra Mutzel, Lutz Oettershagen |
On the Enumeration of Bicriteria Temporal Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation - 15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13-16, 2019, Proceedings, pp. 518-535, 2019, Springer, 978-3-030-14811-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
19 | Man-Fai Leung, Jun Wang 0002 |
A Collaborative Neurodynamic Optimization Approach to Bicriteria Portfolio Selection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNN (1) ![In: Advances in Neural Networks - ISNN 2019 - 16th International Symposium on Neural Networks, ISNN 2019, Moscow, Russia, July 10-12, 2019, Proceedings, Part I, pp. 318-327, 2019, Springer, 978-3-030-22795-1. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|