Search results for "Bicriteria"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
99	Panagiotis Kouvelis, Serpil Sayin	Algorithm robust for the bicriteria discrete optimization problem.	Ann. Oper. Res.	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.	ICALP	1995	DBLP DOI BibTeX RDF
70	Yuval Rabani, Gabriel Scalosub	Bicriteria approximation tradeoff for the node-cost budget problem.	ACM Trans. Algorithms	2009	DBLP DOI BibTeX RDF	Approximation algorithms, bicriteria approximation
62	Anita Schöbel, Albrecht Kratz	A Bicriteria Approach for Robust Timetabling.	Robust and Online Large-Scale Optimization	2009	DBLP DOI BibTeX RDF
62	Anita Schöbel	Locating Stops Along Bus or Railway Lines - A Bicriteria Problem.	Ann. Oper. Res.	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.	ISAAC	2009	DBLP DOI BibTeX RDF
56	Fabien Baille, Evripidis Bampis, Christian Laforest, Christophe Rapine	Bicriteria scheduling for contiguous and non contiguous parallel tasks.	Ann. Oper. Res.	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.	J. Sched.	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.	CAAN	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.	IPDPS	2008	DBLP DOI BibTeX RDF
48	Yuval Rabani, Gabriel Scalosub	Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem.	SWAT	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.	IPCO	2007	DBLP DOI BibTeX RDF
48	Vittorio Bilò, Michele Flammini, Roberto Giovannelli	Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem.	WEA	2003	DBLP DOI BibTeX RDF
41	Baoqiang Fan, Rongjun Chen, Guochun Tang	Bicriteria Scheduling on Single-Machine with Inventory Operations.	COCOA	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.	J. Sched.	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.	J. Comb. Optim.	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.	SIROCCO	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.	Ann. Oper. Res.	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.	J. Sched.	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.	IPCO	2004	DBLP DOI BibTeX RDF	bicriteria optimization, scheduling, approximation scheme
37	Konstantin Andreev, Harald Räcke	Balanced graph partitioning.	SPAA	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.	STOC	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.	Ann. Oper. Res.	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.	FOCS	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.	IEEE Trans. Parallel Distributed Syst.	2009	DBLP DOI BibTeX RDF
33	Lin Lin 0008, Mitsuo Gen	A bicriteria shortest path routing problems by hybrid genetic algorithm in communication networks.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
33	S. Afshin Mansouri, S. Hamed Hendizadeh, Nasser Salmasi	Bicriteria two-machine flowshop scheduling using metaheuristics.	GECCO	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.	Queueing Syst. Theory Appl.	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.	IPDPS	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.	FCT	2003	DBLP DOI BibTeX RDF
33	Gaofeng Huang, Andrew Lim 0001	Fragmental Optimization on the 2-Machine Bicriteria Flowshop Scheduling Problem.	ICTAI	2003	DBLP DOI BibTeX RDF
29	MohammadHossein Bateni, MohammadTaghi Hajiaghayi	Assignment problem in content distribution networks: unsplittable hard-capacitated facility location.	SODA	2009	DBLP DOI BibTeX RDF
29	Daniel Berend, Michael Segal 0001, Hanan Shpungin	Power efficient resilience and lifetime in wireless ad-hoc networks.	FOWANC	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.	SODA	2008	DBLP BibTeX RDF
29	Sanjiv Kapoor, Mohammad Sarwat	Bounded-Diameter Minimum-Cost Graph Problems.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
29	Julia Chuzhoy, Sanjeev Khanna	Hardness of cut problems in directed graphs.	STOC	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.	GECCO	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.	STOC	2002	DBLP DOI BibTeX RDF	TCP/IP
29	Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe	Budget Constrained Minimum Cost Connected Medians.	WG	2000	DBLP DOI BibTeX RDF
29	Fumihiko Shimada, Hiroaki Ishii, Takeshi Itoh	Spanning tree problem on a fuzzy network.	KES (1)	1998	DBLP DOI BibTeX RDF
29	Madhav V. Marathe, R. Ravi 0001, Ravi Sundaram	Service-Constrained Network Design Problems.	SWAT	1996	DBLP DOI BibTeX RDF
22	Jochen Könemann, Asaf Levin, Amitabh Sinha	Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem.	Algorithmica	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.	FOCS	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	FOCS	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.	J. Sched.	2024	DBLP DOI BibTeX RDF
19	Shuguang Li, Zhichao Geng	Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost.	Inf. Process. Lett.	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.	INFOR Inf. Syst. Oper. Res.	2023	DBLP DOI BibTeX RDF
19	Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula	The complexity of bicriteria tree-depth.	Theor. Comput. Sci.	2023	DBLP DOI BibTeX RDF
19	Khaled Elbassioni	A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces.	Oper. Res. Lett.	2023	DBLP DOI BibTeX RDF
19	Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm	Bicriteria Multidimensional Mechanism Design with Side Information.	CoRR	2023	DBLP DOI BibTeX RDF
19	Wenjing Chen, Victoria G. Crawford	Bicriteria Approximation Algorithms for the Submodular Cover Problem.	CoRR	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.	Appl. Soft Comput.	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.	Eur. J. Oper. Res.	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.	Math. Program.	2023	DBLP DOI BibTeX RDF
19	Yijie Li	Bicriteria fabrication scheduling of two-component jobs on a single machine.	Oper. Res.	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.	J. Comput. Appl. Math.	2023	DBLP DOI BibTeX RDF
19	Hangjun Che, Jun Wang 0002, Andrzej Cichocki	Bicriteria Sparse Nonnegative Matrix Factorization via Two-Timescale Duplex Neurodynamic Optimization.	IEEE Trans. Neural Networks Learn. Syst.	2023	DBLP DOI BibTeX RDF
19	Mei Liu, Li He, Mingsheng Shang 0001	Dynamic Neural Network for Bicriteria Weighted Control of Robot Manipulators.	IEEE Trans. Neural Networks Learn. Syst.	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.	CSoNet	2023	DBLP DOI BibTeX RDF
19	Wenjing Chen, Victoria G. Crawford	Bicriteria Approximation Algorithms for the Submodular Cover Problem.	NeurIPS	2023	DBLP BibTeX RDF
19	Siddharth Prasad, Maria-Florina Balcan, Tuomas Sandholm	Bicriteria Multidimensional Mechanism Design with Side Information.	NeurIPS	2023	DBLP BibTeX RDF
19	Tanvi Bajpai, Chandra Chekuri	Bicriteria Approximation Algorithms for Priority Matroid Median.	APPROX/RANDOM	2023	DBLP DOI BibTeX RDF
19	Victoria G. Crawford	Scalable Bicriteria Algorithms for Non-Monotone Submodular Cover.	AISTATS	2023	DBLP BibTeX RDF
19	Hari Nandan Nath, Stephan Dempe, Tanka Nath Dhamala	A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow.	Asia Pac. J. Oper. Res.	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.	Asia Pac. J. Oper. Res.	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.	Ann. Oper. Res.	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.	IEEE Trans. Ind. Informatics	2022	DBLP DOI BibTeX RDF
19	Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay	SETH-based Lower Bounds for Subset Sum and Bicriteria Path.	ACM Trans. Algorithms	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.	IEEE Trans. Cogn. Dev. Syst.	2022	DBLP DOI BibTeX RDF
19	Tanvi Bajpai, Chandra Chekuri	Bicriteria Approximation Algorithms for Priority Matroid Median.	CoRR	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.	Oper. Res.	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.	J. Comb. Optim.	2022	DBLP DOI BibTeX RDF
19	Tim Oosterwijk, Daniel Schmand, Marc Schröder 0002	Bicriteria Nash Flows over Time.	WINE	2022	DBLP BibTeX RDF
19	Joanna Jedrzejowicz, Piotr Jedrzejowicz	Bicriteria Oversampling for Imbalanced Data Classification.	KES	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.	AAIM	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.	Robotics Comput. Integr. Manuf.	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.	Theor. Comput. Sci.	2021	DBLP DOI BibTeX RDF
19	Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula	The Complexity of Bicriteria Tree-Depth.	CoRR	2021	DBLP BibTeX RDF
19	Tim Oosterwijk, Daniel Schmand, Marc Schröder 0002	Bicriteria Nash Flows over Time.	CoRR	2021	DBLP BibTeX RDF
19	Victoria G. Crawford	Streaming Based Bicriteria Approximation Algorithms for Submodular Optimization.	CoRR	2021	DBLP BibTeX RDF
19	Jonathan A. Noel, Mashbat Suzuki, Adrian Vetta	Pirates in Wonderland: Liquid Democracy has Bicriteria Guarantees.	CoRR	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.	Swarm Evol. Comput.	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.	Comput. Ind. Eng.	2021	DBLP DOI BibTeX RDF
19	Jonathan A. Noel, Mashbat Suzuki, Adrian Vetta	Pirates in Wonderland: Liquid Democracy has Bicriteria Guarantees.	SAGT	2021	DBLP DOI BibTeX RDF
19	Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula	The Complexity of Bicriteria Tree-Depth.	FCT	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.	GIScience (II)	2021	DBLP DOI BibTeX RDF
19	Weijun Xie 0001, Shabbir Ahmed 0001	Bicriteria Approximation of Chance-Constrained Covering Problems.	Oper. Res.	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.	Int. Trans. Oper. Res.	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.	Int. Trans. Oper. Res.	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.	Theor. Comput. Sci.	2020	DBLP DOI BibTeX RDF
19	Qiulan Zhao, Jinjiang Yuan	Bicriteria scheduling of equal length jobs on uniform parallel machines.	J. Comb. Optim.	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.	AAIM	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.	Math. Comput. Simul.	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.	Soft Comput.	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.	Algorithms	2019	DBLP DOI BibTeX RDF
19	Haitao Wang 0001	Bicriteria Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane.	Discret. Comput. Geom.	2019	DBLP DOI BibTeX RDF
19	Andrea Farruggia, Paolo Ferragina, Antonio Frangioni, Rossano Venturini	Bicriteria Data Compression.	SIAM J. Comput.	2019	DBLP DOI BibTeX RDF
19	Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay	SETH-Based Lower Bounds for Subset Sum and Bicriteria Path.	SODA	2019	DBLP DOI BibTeX RDF
19	Petra Mutzel, Lutz Oettershagen	On the Enumeration of Bicriteria Temporal Paths.	TAMC	2019	DBLP DOI BibTeX RDF
19	Man-Fai Leung, Jun Wang 0002	A Collaborative Neurodynamic Optimization Approach to Bicriteria Portfolio Selection.	ISNN (1)	2019	DBLP DOI BibTeX RDF